
	Where results make sense

Topic: Von Neumann conjecture

Related Topics

John Selfridge

Strong perfect graph conjecture

Dysprosia

List of colonial governors in 1873

Valley Hill, North Carolina

White Lake, North Carolina

Harpersville, Alabama

Thomas Wynns

Kings Beach, California

Parkend, Gloucestershire

Clinton Hill, Brooklyn

Peter Svidler

Amur Cossaks

Plan de Casa Mata

Jeffrey Rooker

	John von Neumann - Wikipedia, the free encyclopedia
		Von Neumann was invited to Princeton, New Jersey in 1930, and was one of four people selected for the first faculty of the Institute for Advanced Study (two of which were Albert Einstein and Kurt Gödel), where he was a mathematics professor from its formation in 1933 until his death.
		Von Neumann was diagnosed with bone cancer or pancreatic cancer in 1957, possibly caused by exposure to radioactivity while observing A-bomb tests in the Pacific, and possibly in later work on nuclear weapons at Los Alamos, New Mexico.
		Von Neumann had collaborated with the spy Klaus Fuchs on hydrogen bomb development, and the two filed a secret patent on "Improvement in Methods and Means for Utilizing Nuclear Energy" in 1946, which outlined a scheme for using an exploding fission bomb to compress fusion fuel before attempting to initiate a thermonuclear reaction.
	en.wikipedia.org /wiki/John_von_Neumann (4000 words)

	Von Neumann conjecture - Wikipedia, the free encyclopedia
		In mathematics, the von Neumann conjecture, disproved in recent years, stated that a topological group G is not amenable if and only if G contains a subgroup that is a free group on two generators.
		Although his name is popularly attached to the conjecture, it does not seem that he believed the converse to be true.
		The conjecture was shown to be false in 1980 by Ol'shanskii; he demonstrated that the Tarski monster group, which is easily seen not to have a free subgroup of rank 2, is not amenable.
	en.wikipedia.org /wiki/Von_Neumann_conjecture (273 words)

	NASA's Advanced Automation for Space Missions: Chapter 5.2
		Von Neumann had a tremendous range of interests - he contributed to the logical foundations of quantum theory, was the co-inventor of the theory of games, and he worked on the Manhattan Project (contributing to the design of the implosion mechanism for the plutonium bomb).
		Von Neumann is not known to have left any completed work whatsoever on these models at the time of his death, so his intentions are almost entirely a matter of conjecture.
		Von Neumann employed two copies of the instructions because it eliminated the criticism that the instructions might, in the first (construction) phase, become corrupted and so not be able to transmit a true version for the use of offspring machine.
	www.islandone.org /MMSG/aasm/AASM52.html (8337 words)

	John von Neumann - Wikipedia, the free encyclopedia
		Von Neumann had one child, by his first marriage, his daughter Marina.
		John von Neumann's wartime Los Alamos ID badge photo.
		Von Neumann, a crater on Earth's Moon, is named after John von Neumann.
	en.wikipedia.org /wiki/Von_Neumann (4000 words)

	Amazon.ca: Prisoner's Dilemma: Books: William Poundstone (Site not responding. Last check: 2007-10-14)
		Von Neumann was a brilliant mathematician who was the major figure in the Manhattan Project and later an active public figure.
		We are told about von Neumann's awful advice to the US Government to ‚nuke' the USSR immediately in the early fifties, and the reader will not be blamed if she calls to mind the ‚preemptive war in Iraq' based on the Bush Administration's aim/claim ‚to find weapons of mass destruction'.
		Von Neumann is not exactly a household name like Einstein, yet his genius equalled (and some would say surpassed) the latter's, because he produced major contributions to the fields of physics, mathematics, economics, and computer science.
	www.amazon.ca /Prisoners-Dilemma-William-Poundstone/dp/038541580X (1301 words)

	2.1.1
		Von Neumann set for himself the goal of showing what the logical organization of a self-replicating machine might be.
		Von Neumann ultimately produced only a very informal description of the kinematic machine, and although he wrote a great deal on the cellular machine, his magnum opus on the subject was left in the form of unfinished notes at the time of his death in 1957 [3, 4].
		Von Neumann finessed (and obscured) this point by implicitly restricting attention to ‘initially quiescent’ automata in his particular cellular automaton formulation.
	www.molecularassembler.com /KSRM/2.1.1.htm (1126 words)

	John von Neumann and the Evolutionary Growth of Complexity: Looking Backwards, Looking Forwards...
		Von Neumann's design is large and complex, and relies for its operation on exact and intricate interactions between the many relatively simple parts.
		By re-examining von Neumann's work in the light of his own description of the problem he was working on, I have tried to show that there is much more substance to it than has been generally recognised.
		In conclusion, it seems to me that von Neumann's work in Artificial Life--properly understood--is as profound and important today as it was half a century ago; and that it should continue to provide structure, insight and inspiration to the field for many years to come.
	www.eeng.dcu.ie /~alife/bmcm-alj-2000/html-single (7432 words)

	The Von Neumann Self-reproducing Architecture, Genetic Relativism and Evolvability
		The von Neumann architecture for self-reproduction is based on the idea of a `general constructive automaton''.
		Now von Neumann is not yet trying to capture all the complications of biological evolution: he is merely trying to establish that some key features, at least, can be recreated in a formal, or artificial, system.
		von Neumann, J. Theory and Organization of Complicated Automata, in A. Burks, ed., `Theory of Self-Reproducing Automata [by] John von Neumann', University of Illinois Press, Urbana, pp.
	www.eeng.dcu.ie /~alife/bmcm-2000-02/html-single/bmcm-2000-02.html (2621 words)

	[No title] (Site not responding. Last check: 2007-10-14)
		Abstract: Von Neumann conjectured that every complete, c.c.c.
		Although consistent counterexamples have been obtained, whether von Neumann's conjecture is consistent with ZFC remains an open problem.
		In view of this, it is of interest to investigate distributive laws in complete, c.c.c.
	www.math.psu.edu /simpson/logic/seminar/010424.txt (186 words)

	Hardware, Software and Impact
		Unlike a Von Neumann design where all designs are variations on the basic principles, a parallel computer has many alternative designs, each of which is best suited for a particular class of problems.
		Von Neumann computers are much better at arithmetic operations than humans, but much worse at pattern recognition.
		The conjecture was four, however, no one was able to offer a proof until some mathematicians at the University of Illinois programmed their parallel processor.
	www.eco.utexas.edu /faculty/Norman/long/hard-soft.html (8462 words)

	Queen's Operator Algebra Seminar Fall 2004
		As a special case, we obtain a category isomorphism between the category of von Neumann $\bf C$-$B$-modules (that is, right von Neumann $B$- modules) and the category of von Neumann $B'$-$\bf C$-modules (that is, unital normal representations of $B'$ on a Hilbert space), and back.
		A normal $$-functor from the von* Neumann $B$-modules into the von Neuman $C$-modules is, thus, translated into a normal $*$-functor from the normal unital representations of $B'$ into those of $C'$, and back.
		Hereby, the von Neumann $B$-$C$-module implementing the first functor by tensoring from the right is mapped to its commutant implementing the second functor by tensoring from the left, and back.
	www.mast.queensu.ca /~mingo/seminar/fall_2004.html (1347 words)

	A Survey of Operator Algebras
		Motivated by quantum mechanics and group representation theory, John von Neumann introduced in the early 30's certain algebras of bounded operators on a Hilbert space, the so-called von Neumann algebras.
		Dan Voiculescu's free probability theory introduced probabilistic methods to the analysis of von Neumann algebras associated to free groups and his new concept of free entropy can be viewed as a measure of freeness in this context.
		In 1980, von Klitzing showed that the Hall conductivity of a disordered crystal is quantized and in 1985 he won the Nobel prize in Physics (at the age of 42) for this discovery.
	www.math.wm.edu /~tomforde/opsurvey.html (723 words)

	Stanislaw M. Ulam Papers, American Philosophical Society
		Von Neumann confirmed Ulam's results through calculations run on the Princeton computer, one of the earliest electronic computing machines of its kind, and by April, 1950, Ulam had developed an alternative configuration, which he published jointly with Teller as a classified paper.
		Ulam was honored with such awards as the Sierpinski Medal, the Polish Millennium Prize, and the Polish American Congress Heritage Award, and was named the John von Neumann Lecturer of the Society of Applied and Industrial Mathematics.
		Von Neumann's contributions to mathematics and computing figure prominently in Ulam's correspondence and writings (Series VIII and IX).
	www.amphilsoc.org /library/mole/u/ulam.htm (4719 words)

	Von Neumann machine (Site not responding. Last check: 2007-10-14)
		A von Neumann machine is a model created by John von Neumann for a computing machine that uses a single storage structure to hold both the set of instructions on how to perform the computation and the data required or generated by the computation.
		Computers using this architecture are said to be "von Neumann machines." The term "von Neumann machine" has also been used informally to refer to the idea of a self-reproducing machine.
		The term "von Neumann machine" is less specific and, confusingly, also refers to a completely unrelated computer architecture proposed by von Neumann (see above), so the use of this misnomer should be discouraged whenever accuracy is important.
	www.choam.info /title/vo/von-neumann-machine.html (360 words)

	BibTeX bibliography von-neumann-john.bib
		%%% %%% Von Neumann was first known as Jan{\'o}s in %%% Hungary, then Johann in Germany, and finally %%% John (or Johnny to his friends, and the %%% source of name of the JOHNNIAC (JOHn Neumann %%% Integrator and Automatic Computer) (1953)).
		Reprinted in \cite[Paper~19]{Taub:1963:JNCb}.", acknowledgement = ack-nhfb, } @Article{Chandrasekhar:1944:SGFa, author = "Subramanyan Chandrasekhar and John von Neumann", title = "The statistics of the gravitational field arising from a random distribution of stars.
		Reprinted in \cite[Paper~1]{Taub:1963:JNCa}.", acknowledgement = ack-nhfb, xxnote = "Check: is this the same as \cite{vonNeumann:1945:PLS}??", } @Unpublished{vonNeumann:1946:SBS, author = "John von Neumann", title = "Statement Before the {Special Senate Committee on Atomic Energy}", year = "1946", bibdate = "Wed Jun 08 10:03:54 2005", note = "Unpublished manuscript, prepared prior to the January 31, 1946, hearing.
	www.math.utah.edu /ftp/pub/bibnet/authors/v/von-neumann-john.html (2237 words)

	Math Seminars (Site not responding. Last check: 2007-10-14)
		The notion of an amenable group was introduced (under the name measurable) by von Neumann in 1929 with a purpose of understandings the roots of the phenomenon known as Banach-Tarskii Paradox.
		There are hundreds of equivalent definitions of the class of amenable groups, but we are still very far from having a complete picture which describes which groups are amenable and which are not.
		In my talk I will focus on a series of results related to two Problems of M.Day from 1957, one of which is known as von Neumann Conjecture.
	www.math.psu.edu /dynsys/abstracts-2004/grigorchuk1.html (225 words)

	Origins of CelLab (Site not responding. Last check: 2007-10-14)
		In 1948 von Neumann read a paper called "The General and Logical Theory of Automata" to a symposium in Pasadena, California, and in 1949 he delivered a related series of lectures called "Theory and Organization of Complicated Automata," at the University of Illinois.
		Ulam's suggestion was that instead of talking about machine parts in a reservoir, von Neumann should think in terms of an idealized space of cells that could hold finite state-numbers representing different sorts of parts.
		Von Neumann's CA work was not published during his lifetime; it seems that once he saw the solution, he became distracted and moved on to other things.
	www.mathcs.sjsu.edu /faculty/rucker/celdoc/chap5.html (4867 words)

	Dreams of a Cosmic Community
		This was an interesting conjecture because, for the first time, it posited a cosmic evolutionary process endowed with what economists call a utility function (i.e., a value that was maximized by the hypothesized evolutionary process, which in the case of Smolin's conjecture was fl hole maximization).
		As the computer genius John von Neumann demonstrated in a famous 1948 Caltech lecture entitled "On the General and Logical Theory of Automata," any self-reproducing object (mouse, bacterium, human, or baby universe) must, as a matter of inexorable logic, possess four essential elements:
		The goal was to rescue Smolin's basic innovation-a cosmic evolutionary model that incorporated a discernible utility function-by proposing scientifically plausible candidates for the two missing von Neumann elements.
	www.science-spirit.org /article_detail.php?article_id=375 (1010 words)

	Computational Model of Artificial Life (Site not responding. Last check: 2007-10-14)
		Using this model, a family of non-trivial self-replicating structures have been created which are substantially smaller and simpler than those created by previous methods, starting with Von Neumann's conjecture 40 uears ago.
		The current focus of this project is on the development of computational models for the formation of membranes and other forms of biological compartment structures known as lipsomes from lipid-like polar molecules (amphiphiles).
		Lipsomes such as single layer micelles and reverse micelles and bilayer membranes have been conjectured to be crucial for the evolution of early life.
	www.cs.umbc.edu /www/research/projects/artlife.html (289 words)

	Topological field theory of the initial singularity of spacetime (Site not responding. Last check: 2007-10-14)
		von Neumann algebra describing the zero scale of spacetime.
		Then we suggest that the (pre-)spacetime is in thermodynamical equilibrium at the Planck-scale and is therefore subject to the KMS condition.
		Then we conjecture that the transition from the topological phase of the spacetime (around the zero scale) to the physical phase observed beyond the Planck scale should be deeply connected to the supersymmetry breaking of the N = 2 supergravity.
	stacks.iop.org /0264-9381/18/4341 (416 words)

	Referências (Site not responding. Last check: 2007-10-14)
		The Origins of John von Neumann's Theory of Automata.
		The Computer and the Brain: An International Symposium in Commemoration of John von Neumann (1903-1957), volume 11(3) de Annals of the History of Computing (número especial), 1989.
		The Legacy of John von Neumann, volume 50 de Proceedings of Symposia in Pure Mathematics.
	www.ic.unicamp.br /~tomasz/projects/vonneumann/node8.html (441 words)

	Sunnyvale, CA – September 5th, 2003 -- HelixoMetry, inc. announces “The Genome Duality Principle” by ...
		The Principle attributes coding- and non-coding DNA a mutually supportive role in which neither is inferior to the other, thereby changing Genomics from a fishing expedition for fewer and fewer genes into an Information Challenge of colossal proportions to decipher the genetic code in which both “coding” and “non-coding” DNA play an essential part.
		The Principle is similar to von Neumann’s architecture of computers where zeros and ones could either represent programs or data.
		“Von Neumann and Eugene Wigner, two of my fellow-country men spearheaded science pursuing the concept of dual representation in Nature.
	www.emediawire.com /releases/2003/9/prweb78916.php (908 words)

	Programming
		As Church's Conjecture appears to be true, we don't need to completely throw away the labors of the past when we get a new machine.
		von Neumann assembled a team at IAS to build the machine as outlined in the report.
		One striking difference between the 1946 Burks, Goldstine, and von Neumann report and modern architecture manuals is the absence of the machine code, or instruction layout.
	insar.stanford.edu /~lharcke/programming (2180 words)

	week140
		Von Neumann might be my candidate for the best mathematical physicist of the 20th century.
		Hans Bethe, no dope himself, said of von Neumann that "I always thought his brain indicated that he belonged to a new species, an evolution beyond man".
		While von Neumann is one of those titans that dominated the first half of the 20th century, Smale is more typical of the latter half - he protested the Vietnam war, and now he even has his own web page!
	math.ucr.edu /home/baez/week140.html (2217 words)

	Mathematics: Events
		The recent proof of the Poincaré Conjecture, a century-old problem in 3-dimensional geometry, has made many headlines this summer.
		I will explain what the Poincaré Conjecture was, and also introduce its less talked about (but perhaps more important) extension the Geometrization Conjecture.
		I will try to convey why mathematicians cared about these problems, why physicists may be interested in their solution, and what the current and future impact of these breakthroughs is likely to be.
	www.usc.edu /schools/college/mathematics/events.html (679 words)

	UIUC Number Theory: Faculty Research Descriptions
		He held positions at the Institute of Mathematics of the Romanian Academy (researcher since 1988) and University of Toronto (postdoctoral fellow 1993-1995), and was a EPSRC advanced research fellow in the UK between 1995-1997 (University of Wales Swansea) and 1998-2001 (Cardiff University).
		His research, primarily concerned with a series of topics in Operator Algebras (both C* and von Neumann algebras), has connected at first with Number Theory in his work on the structure of non-commutative tori and some of their subalgebras.
		In particular, he was able to prove a 20 year old conjecture of Erdös and Gaal, another one of Roger Baker and to disprove a more than 30 year old conjecture of Erdös on this subject.
	www.math.uiuc.edu /ResearchAreas/numbertheory/facultyresearch.html (3429 words)

	Publication list
		Lipschitz algebras and derivations of von Neumann algebras, J. Funct.
		A geometric spectral theory for n-tuples of self-adjoint operators in finite von Neumann algebras (with C. Akemann and J. Anderson), J.
		A counterexample to a conjecture of Akemann and Anderson, Bull.
	www.math.wustl.edu /~nweaver/publications/pubs.html (255 words)

Try your search on: Qwika (all wikis)