John von Neumann
Von Neumann in the 1940s
Born	(1903-12-28)December 28, 1903 Budapest, Austria-Hungary
Died	February 8, 1957(1957-02-08) (aged 53) Washington, D.C., United States
Residence	United States
Nationality	Hungarian and American
Fields	Mathematics and computer science
Institutions	University of Berlin Princeton University Institute for Advanced Study Site Y, Los Alamos
Alma mater	University of Pázmány Péter ETH Zürich
Doctoral advisor	Lipót Fejér
Doctoral students	Donald B. Gillies Israel Halperin
Other notable students	Paul Halmos Clifford Hugh Dowker
Known for	Abelian von Neumann algebra Affiliated operator Amenable group Arithmetic logic unit Artificial viscosity Axiom of regularity Axiom of limitation of size Backward induction Blast wave (fluid dynamics) Bounded set (topological vector space) Class (set theory) Decoherence theory Computer virus Commutation theorem Continuous geometry Direct integral Doubly stochastic matrix Duality Theorem Density matrix Durbin–Watson statistic Game theory Hyperfinite type II factor Ergodic theory EDVAC explosive lenses Lattice theory Lifting theory Inner model Inner model theory Interior point method Mutual assured destruction Merge sort Middle-square method Minimax theorem Monte Carlo method Normal-form game Pointless topology Polarization identity Pseudorandomness PRNG Quantum mutual information Radiation implosion Rank ring Operator theory Operation Greenhouse Self-replication Software whitening Standard probability space Stochastic computing Subfactor von Neumann algebra von Neumann architecture Von Neumann bicommutant theorem Von Neumann cardinal assignment Von Neumann cellular automaton von Neumann constant (two of them) Von Neumann interpretation von Neumann measurement scheme Von Neumann Ordinals Von Neumann universal constructor Von Neumann entropy von Neumann Equation Von Neumann neighborhood Von Neumann paradox Von Neumann regular ring Von Neumann–Bernays–Gödel set theory Von Neumann spectral theory Von Neumann universe Von Neumann conjecture Von Neumann's inequality Stone–von Neumann theorem Von Neumann's trace inequality Von Neumann stability analysis Quantum statistical mechanics Von Neumann extractor Von Neumann ergodic theorem Ultrastrong topology Von Neumann–Morgenstern utility theorem ZND detonation model
Notable awards	Enrico Fermi Award (1956)
Signature John von Neumann's signature

John von Neumann ( /vɒn ˈnɔɪmən/; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,^[1] including set theory, functional analysis, quantum mechanics, ergodic theory, geometry, fluid dynamics, economics, linear programming, game theory, computer science, numerical analysis, hydrodynamics, and statistics, as well as many other mathematical fields. He is generally regarded as one of the greatest mathematicians in modern history.^[2] The mathematician Jean Dieudonné called von Neumann "the last of the great mathematicians",^[3] while Peter Lax described him as possessing the most "fearsome technical prowess" and "scintillating intellect" of the century,^[4] and Hans Bethe stated "I have sometimes wondered whether a brain like von Neumann's does not indicate a species superior to that of man".^[5] Even in Budapest, in the time that produced geniuses like Theodore von Kármán (b. 1881), George de Hevesy (b. 1885), Leó Szilárd (b. 1898), Eugene Wigner (b. 1902), Edward Teller (b. 1908), and Paul Erdős (b. 1913), his brilliance stood out.^[6]

Von Neumann was a pioneer of the application of operator theory to quantum mechanics, in the development of functional analysis, a principal member of the Manhattan Project and the Institute for Advanced Study in Princeton (as one of the few originally appointed), and a key figure in the development of game theory^[1][7] and the concepts of cellular automata,^[1] the universal constructor, and the digital computer. Von Neumann's mathematical analysis of the structure of self-replication preceded the discovery of the structure of DNA.^[8] In a short list of facts about his life he submitted to the National Academy of Sciences, he stated "The part of my work I consider most essential is that on quantum mechanics, which developed in Göttingen in 1926, and subsequently in Berlin in 1927–1929. Also, my work on various forms of operator theory, Berlin 1930 and Princeton 1935–1939; on the ergodic theorem, Princeton, 1931–1932." Along with Teller and Stanisław Ulam, von Neumann worked out key steps in the nuclear physics involved in thermonuclear reactions and the hydrogen bomb.

Von Neumann wrote 150 published papers in his life; 60 in pure mathematics, 20 in physics, and 60 in applied mathematics. His last work, an unfinished manuscript written while in the hospital and later published in book form as The Computer and the Brain, gives an indication of the direction of his interests at the time of his death.

Early life[link]

Von Neumann was born Neumann János Lajos (Hungarian pronunciation: [ˈnojmɒn ˈjaːnoʃ ˈlɒjoʃ]; in Hungarian the family name comes first) in Budapest, Austro-Hungarian Empire, to wealthy Jewish parents.^[9][10][11] He was the eldest of three brothers. His father, Neumann Miksa (Max Neumann) was a banker, who held a doctorate in law. He had moved to Budapest from Pécs at the end of 1880s. His father (Mihály b. 1839)^[12] and grandfather (Márton)^[12] were both born in Ond (present day town of Szerencs?), Zemplén county, northern Hungary. John's mother was Kann Margit (Margaret Kann).^[13] In 1913, his father was elevated to the nobility for his service to the Austro-Hungarian empire by Emperor Franz Josef. The Neumann family thus acquiring the hereditary title margittai, Neumann János became margittai Neumann János (John Neumann of Margitta), which he later changed to the German Johann von Neumann. János, nicknamed "Jancsi" (Johnny), was an extraordinary child prodigy in the areas of language, memorization, and mathematics. As a 6 year old, he could divide two 8-digit numbers in his head.^[14] By the age of 8, he was familiar with differential and integral calculus.^[15]

John entered the German-speaking Lutheran high school Fasori Evangelikus Gimnázium in Budapest in 1911. Although his father insisted he attend school at the grade level appropriate to his age, he agreed to hire private tutors to give him advanced instruction in those areas in which he had displayed an aptitude. At the age of 15, he began to study advanced calculus under the renowned analyst Gábor Szegő. On their first meeting, Szegő was so astounded with the boy's mathematical talent that he was brought to tears.^[16] Szegő subsequently visited the von Neumann house twice a week to tutor the child prodigy. Some of von Neumann's instant solutions to the problems in calculus posed by Szegő, sketched out with his father's stationery, are still on display at the von Neumann archive in Budapest.^[17] By the age of 19, von Neumann had published two major mathematical papers, the second of which gave the modern definition of ordinal numbers, which superseded Georg Cantor's definition.^[18]

He received his Ph.D. in mathematics (with minors in experimental physics and chemistry) from Pázmány Péter University in Budapest at the age of 22.^[1] He simultaneously earned a diploma in chemical engineering from the ETH Zurich in Switzerland^[1] at the behest of his father, who wanted his son to follow him into industry and therefore invest his time in a more financially useful endeavour than mathematics.^{[N 1]}

Career and abilities[link]

Beginnings[link]

Between 1926 and 1930, he taught as a Privatdozent at the University of Berlin, one of the youngest in its history.^{[N 2]} By the end of 1927, von Neumann had published twelve major papers in mathematics, and by the end of 1929, thirty-two papers, at a rate of nearly one major paper per month.^[19] Von Neumann's powers of speedy, massive memorization and recall allowed him to recite volumes of information, and even entire directories, with ease.^[5]

In 1930, von Neumann was invited to Princeton University, New Jersey, and, subsequently, was one of the first four people selected for the faculty of the Institute for Advanced Study (two of the others being Albert Einstein and Kurt Gödel), where he remained a mathematics professor from its formation in 1933 until his death. His father, Max von Neumann had died in 1929. But his mother, and his brothers followed John to the United States. He anglicized his first name to John, keeping the Austrian-aristocratic surname of von Neumann. In 1937, von Neumann became a naturalized citizen of the U.S. In 1938, he was awarded the Bôcher Memorial Prize for his work in analysis. Von Neumann married twice. He married Mariette Kövesi in 1930, just prior to emigrating to the United States. They had one daughter (von Neumann's only child), Marina, who is now a distinguished professor of international trade and public policy at the University of Michigan. The couple divorced in 1937. In 1938, von Neumann married Klara Dan, whom he had met during his last trips back to Budapest prior to the outbreak of World War II. The von Neumanns were very active socially within the Princeton academic community.

Set theory[link]

This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (April 2007)

The axiomatization of mathematics, on the model of Euclid's Elements, had reached new levels of rigor and breadth at the end of the 19th century, particularly in arithmetic (thanks to the axiom schema of Richard Dedekind and Charles Sanders Peirce) and geometry (thanks to David Hilbert). At the beginning of the 20th century, efforts to base mathematics on naive set theory suffered a setback due to Russell's paradox (on the set of all sets that do not belong to themselves).

The problem of an adequate axiomatization of set theory was resolved implicitly about twenty years later (by Ernst Zermelo and Abraham Fraenkel). Zermelo and Fraenkel provided a series of principles that allowed for the construction of the sets used in the everyday practice of mathematics: But they did not explicitly exclude the possibility of the existence of a set that belongs to itself. In his doctoral thesis of 1925, von Neumann demonstrated two techniques to exclude such sets: the axiom of foundation and the notion of class.

Excerpt from the university calendars for 1928 and 1928/29 of the Friedrich-Wilhelms-Universität Berlin announcing Neumann's lectures on axiomatic set theory and logics, problems in quantum mechanics and special mathematical functions

The axiom of foundation established that every set can be constructed from the bottom up in an ordered succession of steps by way of the principles of Zermelo and Fraenkel, in such a manner that if one set belongs to another then the first must necessarily come before the second in the succession (hence excluding the possibility of a set belonging to itself.) To demonstrate that the addition of this new axiom to the others did not produce contradictions, von Neumann introduced a method of demonstration (called the method of inner models) which later became an essential instrument in set theory.

The second approach to the problem took as its base the notion of class, and defines a set as a class which belongs to other classes, while a proper class is defined as a class which does not belong to other classes. Under the Zermelo/Fraenkel approach, the axioms impede the construction of a set of all sets which do not belong to themselves. In contrast, under the von Neumann approach, the class of all sets which do not belong to themselves can be constructed, but it is a proper class and not a set.

With this contribution of von Neumann, the axiomatic system of the theory of sets became fully satisfactory, and the next question was whether or not it was also definitive, and not subject to improvement. A strongly negative answer arrived in September 1930 at the historic mathematical Congress of Königsberg, in which Kurt Gödel announced his first theorem of incompleteness: the usual axiomatic systems are incomplete, in the sense that they cannot prove every truth which is expressible in their language. This result was sufficiently innovative as to confound the majority of mathematicians of the time. But von Neumann, who had participated at the Congress, confirmed his fame as an instantaneous thinker, and in less than a month was able to communicate to Gödel himself an interesting consequence of his theorem: namely that the usual axiomatic systems are unable to demonstrate their own consistency.^[20] It is precisely this consequence which has attracted the most attention, even if Gödel originally considered it only a curiosity, and had derived it independently anyway (it is for this reason that the result is called Gödel's second theorem, without mention of von Neumann.)

Geometry[link]

Von Neumann founded the field of continuous geometry. It followed his path-breaking work on rings of operators. In mathematics, continuous geometry is a substitute of complex projective geometry, where instead of the dimension of a subspace being in a discrete set 0, 1, ..., n, it can be an element of the unit interval [0,1]. Von Neumann was motivated by his discovery of von Neumann algebras with a dimension function taking a continuous range of dimensions, and the first example of a continuous geometry other than projective space was the projections of the hyperfinite type II factor.

Measure theory[link]

In a series of famous papers, von Neumann made spectacular contributions to measure theory.^[21] The work of Banach had implied that the problem of measure has a positive solution if n = 1 or n = 2 and a negative solution in all other cases. Von Neumann's work argued that the "problem is essentially group-theoretic in character, and that, in particular, for the solvability of the problem of measure the ordinary algebraic concept of solvability of a group is relevant. Thus, according to von Neumann, it is the change of group that makes a difference, not the change of space." In a number of von Neumann's papers, the methods of argument he employed are considered even more significant than the results. In anticipation of his later study of dimension theory in algebras of operators, von Neumann used results on equivalence by finite decomposition, and reformulated the problem of measure in terms of functions (anticipating his later work, Mathematical formulation of quantum mechanics, on almost periodic functions).

In the 1936 paper on analytic measure theory, von Neumann used the Haar theorem in the solution of Hilbert's fifth problem in the case of compact groups.^[21][22]

Ergodic theory[link]

Von Neumann made foundational contributions to ergodic theory, in a series of articles published in 1932, which have attained legendary status in mathematics.^[23] Of the 1932 papers on ergodic theory, Paul Halmos writes that even "if von Neumann had never done anything else, they would have been sufficient to guarantee him mathematical immortality".^[21] By then von Neumann had already written his famous articles on operator theory, and the application of this work was instrumental in the von Neumann mean ergodic theorem.^[24]

Operator theory[link]

Von Neumann introduced the study of rings of operators, through the von Neumann algebras.^[25] A von Neumann algebra is a *-algebra of bounded operators on a Hilbert space that is closed in the weak operator topology and contains the identity operator.

The von Neumann bicommutant theorem shows that the analytic definition is equivalent to a purely algebraic definition as an algebra of symmetries.

The direct integral was introduced in 1949 by John von Neumann. One of von Neumann's analyses was to reduce the classification of von Neumann algebras on separable Hilbert spaces to the classification of factors.

Lattice theory[link]

Garrett Birkhoff writes: "John von Neumann's brilliant mind blazed over lattice theory like a meteor".^[26] Von Neumann worked on lattice theory between 1937 and 1939. Von Neumann provided an abstract exploration of dimension in completed complemented modular topological lattices: "Dimension is determined, up to a positive linear transformation, by the following two properties. It is conserved by perspective mappings ("perspectivities") and ordered by inclusion. The deepest part of the proof concerns the equivalence of perspectivity with "projectivity by decomposition"—of which a corollary is the transitivity of perspectivity."^[26]

Additionally, "[I]n the general case, von Neumann proved the following basic representation theorem. Any complemented modular lattice L having a "basis" of n≥4 pairwise perspective elements, is isomorphic with the lattice ℛ(R) of all principal right-ideals of a suitable regular ring R. This conclusion is the culmination of 140 pages of brilliant and incisive algebra involving entirely novel axioms. Anyone wishing to get an unforgettable impression of the razor edge of von Neumann's mind, need merely try to pursue this chain of exact reasoning for himself—realizing that often five pages of it were written down before breakfast, seated at a living room writing-table in a bathrobe."^[26]

Mathematical formulation of quantum mechanics[link]

Von Neumann was the first to rigorously establish a mathematical framework for quantum mechanics with his work Mathematische Grundlagen der Quantenmechanik.

After having completed the axiomatization of set theory, von Neumann began to confront the axiomatization of quantum mechanics. He immediately realized, in 1926, that a quantum system could be considered as a point in a so-called Hilbert space, analogous to the 6N dimension (N is the number of particles, 3 general coordinate and 3 canonical momentum for each) phase space of classical mechanics but with infinitely many dimensions (corresponding to the infinitely many possible states of the system) instead: the traditional physical quantities (e.g., position and momentum) could therefore be represented as particular linear operators operating in these spaces. The physics of quantum mechanics was thereby reduced to the mathematics of the linear Hermitian operators on Hilbert spaces.

For example, the uncertainty principle, according to which the determination of the position of a particle prevents the determination of its momentum and vice versa, is translated into the non-commutativity of the two corresponding operators. This new mathematical formulation included as special cases the formulations of both Heisenberg and Schrödinger, and culminated in his 1932 book Mathematische Grundlagen der Quantenmechanik.

Von Neumann's abstract treatment permitted him also to confront the foundational issue of determinism vs. non-determinism and in the book he presented a proof according to which quantum mechanics could not possibly be derived by statistical approximation from a deterministic theory of the type used in classical mechanics. In 1966, a paper by John Bell was published, claiming that this proof contained a conceptual error and was therefore invalid (see the article on John Stewart Bell for more information). However, in 2010, Jeffrey Bub published an argument that Bell misconstrued von Neumann's proof, and that it is actually not flawed, after all.^[27] Regardless, the proof inaugurated a line of research that ultimately led, through the work of Bell in 1964 on Bell's theorem, and the experiments of Alain Aspect in 1982, to the demonstration that quantum physics requires a notion of reality substantially different from that of classical physics.

In a chapter of The Mathematical Foundations of Quantum Mechanics, von Neumann deeply analyzed the so-called measurement problem. He concluded that the entire physical universe could be made subject to the universal wave function. Since something "outside the calculation" was needed to collapse the wave function, von Neumann concluded that the collapse was caused by the consciousness of the experimenter (although this view was accepted by Eugene Wigner, it never gained acceptance amongst the majority of physicists).^[28]

Though theories of quantum mechanics continue to evolve to this day, there is a basic framework for the mathematical formalism of problems in quantum mechanics which underlies the majority of approaches and can be traced back to the mathematical formalisms and techniques first used by von Neumann. In other words, discussions about interpretation of the theory, and extensions to it, are now mostly conducted on the basis of shared assumptions about the mathematical foundations.

Quantum logic[link]

In a famous paper of 1936, the first work ever to introduce quantum logics,^[29] von Neumann first proved that quantum mechanics requires a propositional calculus substantially different from all classical logics and rigorously isolated a new algebraic structure for quantum logics. The concept of creating a propositional calculus for quantum logic was first outlined in a short section in von Neumann's 1932 work. But in 1936, the need for the new propositional calculus was demonstrated through several proofs. For example, photons cannot pass through two successive filters which are polarized perpendicularly (e.g. one horizontally and the other vertically), and therefore, a fortiori, it cannot pass if a third filter polarized diagonally is added to the other two, either before or after them in the succession. But if the third filter is added in between the other two, the photons will indeed pass through. And this experimental fact is translatable into logic as the non-commutativity of conjunction Failed to parse (Missing texvc executable; please see math/README to configure.): (A\land B)\ne (B\land A) . It was also demonstrated that the laws of distribution of classical logic, Failed to parse (Missing texvc executable; please see math/README to configure.): P\lor(Q\land R)=(P\lor Q)\land(P\lor R)

and

Failed to parse (Missing texvc executable; please see math/README to configure.): P\land (Q\lor R)=(P\land Q)\lor(P\land R) , are not valid for quantum theory. The reason for this is that a quantum disjunction, unlike the case for classical disjunction, can be true even when both of the disjuncts are false and this is, in turn, attributable to the fact that it is frequently the case, in quantum mechanics, that a pair of alternatives are semantically determinate, while each of its members are necessarily indeterminate. This latter property can be illustrated by a simple example. Suppose we are dealing with particles (such as electrons) of semi-integral spin (angular momentum) for which there are only two possible values: positive or negative. Then, a principle of indetermination establishes that the spin, relative to two different directions (e.g. x and y) results in a pair of incompatible quantities. Suppose that the state ɸ of a certain electron verifies the proposition "the spin of the electron in the x direction is positive." By the principle of indeterminacy, the value of the spin in the direction y will be completely indeterminate for ɸ. Hence, ɸ can verify neither the proposition "the spin in the direction of y is positive" nor the proposition "the spin in the direction of y is negative." Nevertheless, the disjunction of the propositions "the spin in the direction of y is positive or the spin in the direction of y is negative" must be true for ɸ. In the case of distribution, it is therefore possible to have a situation in which Failed to parse (Missing texvc executable; please see math/README to configure.): A \land (B\lor C)= A\land 1 = A , while Failed to parse (Missing texvc executable; please see math/README to configure.): (A\land B)\lor (A\land C)=0\lor 0=0 .

Von Neumann proposes to replace classical logics, with a logic constructed in orthomodular lattices, (isomorphic to the lattice of subspaces of the Hilbert space of a given physical system).^[30]

Game theory[link]

Von Neumann founded the field of game theory as a mathematical discipline. Von Neumann's proved his minimax theorem in 1928. This theorem establishes that in zero-sum games with perfect information (i.e., in which players know at each time all moves that have taken place so far), there exists a pair of strategies for both players that allows each to minimize his maximum losses (hence the name minimax). When examining every possible strategy, a player must consider all the possible responses of his adversary. The player then plays out the strategy which will result in the minimization of his maximum loss.

Such strategies, which minimize the maximum loss for each player, are called optimal. Von Neumann showed that their minimaxes are equal (in absolute value) and contrary (in sign). Another result he proved during his German period was the nonexistence of a static equilibrium. An equilibrium can only exist in an expanding economy. Paul Samuelson edited an anniversary volume dedicated to this short German paper in 1972 and stated in the introduction that von Neumann was the only mathematician ever to make a significant contribution to economic theory.

Von Neumann improved and extended the minimax theorem to include games involving imperfect information and games with more than two players, publishing this result in his 1944 Theory of Games and Economic Behavior (written with Oskar Morgenstern). The public interest in this work was such that The New York Times ran a front-page story. In this book, von Neumann declared that economic theory needed to use functional analytic methods, especially convex sets and topological fixed point theorem, rather than the traditional differential calculus, because the maximum–operator did not preserve differentiable functions.

Independently, Leonid Kantorovich's functional analytic work on mathematical economics also focused attention on optimization theory, non-differentiability, and vector lattices. Von Neumann's functional-analytic techniques—the use of duality pairings of real vector spaces to represent prices and quantities, the use of supporting and separating hyperplanes and convex set, and fixed-point theory—have been the primary tools of mathematical economics ever since.^[31] Von Neumann was also the inventor of the method of proof, used in game theory, known as backward induction (which he first published in 1944 in the book co-authored with Morgenstern, Theory of Games and Economic Behaviour).^[32]

Mathematical economics[link]

Von Neumann raised the intellectual and mathematical level of economics in several stunning publications. For his model of an expanding economy, von Neumann proved the existence and uniqueness of an equilibrium using his generalization of Brouwer's fixed point theorem. Von Neumann's model of an expanding economy considered the matrix pencil  A − λB with nonnegative matrices A and B; von Neumann sought probability vectors p and q and a positive number λ that would solve the complementarity equation

p^T (A − λ B) q = 0,

along with two inequality systems expressing economic efficiency. In this model, the (transposed) probability vector p represents the prices of the goods while the probability vector q represents the "intensity" at which the production process would run. The unique solution λ represents the growth factor which is 1 plus the rate of growth of the economy; the rate of growth equals the interest rate. Proving the existence of a positive growth rate and proving that the growth rate equals the interest rate were remarkable achievements, even for von Neumann.^[33][34][35]

Von Neumann's results have been viewed as a special case of linear programming, where von Neumann's model uses only nonnegative matrices.^[36] The study of von Neumann's model of an expanding economy continues to interest mathematical economists with interests in computational economics.^[37][38][39] This paper has been called the greatest paper in mathematical economics by several authors, who recognized its introduction of fixed-point theorems, linear inequalities, complementary slackness, and saddlepoint duality.

The lasting importance of the work on general equilibria and the methodology of fixed point theorems is underscored by the awarding of Nobel prizes in 1972 to Kenneth Arrow, in 1983 to Gérard Debreu, and in 1994 to John Nash who used fixed point theorems to establish equilibria for noncooperative games and for bargaining problems in his Ph.D thesis. Arrow and Debreu also used linear programming, as did Nobel laureates Tjalling Koopmans, Leonid Kantorovich, Wassily Leontief, Paul Samuelson, Robert Dorfman, Robert Solow, and Leonid Hurwicz.

Linear programming[link]

Building on his results on matrix games and on his model of an expanding economy, von Neumann invented the theory of duality in linear programming, after George B. Dantzig described his work in a few minutes, when an impatient von Neumann asked him to get to the point. Then, Dantzig listened dumbfounded while von Neumann provided an hour lecture on convex sets, fixed-point theory, and duality, conjecturing the equivalence between matrix games and linear programming.^[40]

Later, von Neumann suggested a new method of linear programming, using the homogeneous linear system of Gordan (1873) which was later popularized by Karmarkar's algorithm. Von Neumann's method used a pivoting algorithm between simplices, with the pivoting decision determined by a nonnegative least squares subproblem with a convexity constraint (projecting the zero-vector onto the convex hull of the active simplex). Von Neumann's algorithm was the first interior-point method of linear programming.^[40]

Mathematical statistics[link]

Von Neumann made fundamental contributions to mathematical statistics. In 1941, he derived the exact distribution of the ratio of the mean square of successive differences to the sample variance for independent and identically normally distributed variables.^[41] This ratio was applied to the residuals from regression models and is commonly known as the Durbin–Watson statistic^[42] for testing the null hypothesis that the errors are serially independent against the alternative that they follow a stationary first order autoregression.^[42]

Subsequently, John Denis Sargan and Alok Bhargava^[43] extended the results for testing if the errors on a regression model follow a Gaussian random walk (i.e. possess a unit root) against the alternative that they are a stationary first order autoregression.

Nuclear weapons[link]

von Neumann's wartime Los Alamos ID badge photo.

Beginning in the late 1930s, von Neumann developed an expertise in explosions—phenomena which are difficult to model mathematically. During this period von Neumann was the leading authority of the mathematics of shaped charges. This led him to a large number of military consultancies, primarily for the Navy, which in turn led to his involvement in the Manhattan Project. The involvement included frequent trips by train to the project's secret research facilities in Los Alamos, New Mexico.^[1]

Von Neumann's principal contribution to the atomic bomb itself was in the concept and design of the explosive lenses needed to compress the plutonium core of the Trinity test device and the "Fat Man" weapon that was later dropped on Nagasaki. While von Neumann did not originate the "implosion" concept, he was one of its most persistent proponents, encouraging its continued development against the instincts of many of his colleagues, who felt such a design to be unworkable. He also eventually came up with the idea of using more powerful shaped charges and less fissionable material to greatly increase the speed of "assembly" meaning compression.

When it turned out that there would not be enough U235 to make more than one bomb, the implosive lens project was greatly expanded and von Neumann's idea was implemented. Implosion was the only method that could be used with the plutonium-239 that was available from the Hanford site. His calculations showed that implosion would work if it did not depart by more than 5% from spherical symmetry. After a series of failed attempts with models, 5% was achieved by George Kistiakowsky, and the construction of the Trinity bomb was completed in July 1944.

In a visit to Los Alamos in September 1944, von Neumann showed that the pressure increase from explosion shock wave reflection from solid objects was greater than previously believed if the angle of incidence of the shock wave was between 90° and some limiting angle. As a result, it was determined that the effectiveness of an atomic bomb would be enhanced with detonation some kilometers above the target, rather than at ground level.^[44]

Beginning in the spring of 1945, along with four other scientists and various military personnel, von Neumann was included in the target selection committee responsible for choosing the Japanese cities of Hiroshima and Nagasaki as the first targets of the atomic bomb. Von Neumann oversaw computations related to the expected size of the bomb blasts, estimated death tolls, and the distance above the ground at which the bombs should be detonated for optimum shock wave propagation and thus maximum effect.^[45] The cultural capital Kyoto, which had been spared the firebombing inflicted upon militarily significant target cities like Tokyo in World War II, was von Neumann's first choice, a selection seconded by Manhattan Project leader General Leslie Groves. However, this target was dismissed by Secretary of War Henry Stimson.^[46]

On July 16, 1945, with numerous other Los Alamos personnel, von Neumann was an eyewitness to the first atomic bomb blast, conducted as a test of the implosion method device, 35 miles (56 km) southeast of Socorro, New Mexico. Based on his observation alone, von Neumann estimated the test had resulted in a blast equivalent to 5 kilotons of TNT, but Enrico Fermi produced a more accurate estimate of 10 kilotons by dropping scraps of torn-up paper as the shock wave passed his location and watching how far they scattered. The actual power of the explosion had been between 20 and 22 kilotons.^[44]

After the war, Robert Oppenheimer remarked that the physicists involved in the Manhattan project had "known sin". Von Neumann's response was that "sometimes someone confesses a sin in order to take credit for it."

Von Neumann continued unperturbed in his work and became, along with Edward Teller, one of those who sustained the hydrogen bomb project. He then collaborated with Klaus Fuchs on further development of the bomb, and in 1946 the two filed a secret patent on "Improvement in Methods and Means for Utilizing Nuclear Energy", which outlined a scheme for using a fission bomb to compress fusion fuel to initiate a thermonuclear reaction.^[47] The Fuchs–von Neumann patent used radiation implosion, but not in the same way as is used in what became the final hydrogen bomb design, the Teller–Ulam design. Their work was, however, incorporated into the "George" shot of Operation Greenhouse, which was instructive in testing out concepts that went into the final design.^[48]

The Fuchs–von Neumann work was passed on, by Fuchs, to the USSR as part of his nuclear espionage, but it was not used in the Soviet's own, independent development of the Teller–Ulam design. The historian Jeremy Bernstein has pointed out that ironically, "John von Neumann and Klaus Fuchs, produced a brilliant invention in 1946 that could have changed the whole course of the development of the hydrogen bomb, but was not fully understood until after the bomb had been successfully made."^[48]

The ICBM Committee[link]

In 1955, von Neumann became a commissioner of the United States Atomic Energy Program. Shortly before his death, when he was already quite ill, von Neumann headed the top secret von Neumann ICBM committee. Its purpose was to decide on the feasibility of building an ICBM large enough to carry a thermonuclear weapon. Von Neumann had long argued that while the technical obstacles were great, they could be overcome in time. The SM-65 Atlas passed its first fully functional test in 1959, two years after his death.

Mutually assured destruction[link]

John von Neumann is credited with the equilibrium strategy of Mutually assured destruction, providing the deliberately humorous acronym, MAD. (Other humorous acronyms coined by von Neumann include his computer, the Mathematical Analyzer, Numerical Integrator, and Computer – or MANIAC).

Computer science[link]

The first implementation of von Neumann's self-reproducing universal constructor.^[49] Three generations of machine are shown, the second has nearly finished constructing the third. The lines running to the right are the tapes of genetic instructions, which are copied along with the body of the machines. The machine shown runs in a 32-state version of von Neumann's cellular automata environment.

Von Neumann was a founding figure in computer science.^[50] Von Neumann's hydrogen bomb work was played out in the realm of computing, where he and Stanisław Ulam developed simulations on von Neumann's digital computers for the hydrodynamic computations. During this time he contributed to the development of the Monte Carlo method, which allowed solutions to complicated problems to be approximated using random numbers.

Because using lists of "truly" random numbers was extremely slow, von Neumann developed a form of making pseudorandom numbers, using the middle-square method. Though this method has been criticized as crude, von Neumann was aware of this: he justified it as being faster than any other method at his disposal, and also noted that when it went awry it did so obviously, unlike methods which could be subtly incorrect.

While consulting for the Moore School of Electrical Engineering at the University of Pennsylvania on the EDVAC project, von Neumann wrote an incomplete First Draft of a Report on the EDVAC. The paper, which was widely distributed, described a computer architecture in which the data and the program are both stored in the computer's memory in the same address space.^[51] John von Neumann also consulted for the ENIAC project, when ENIAC was being modified to contain a stored program. Since the modified ENIAC was fully functional by 1948 and the EDVAC wasn't delivered to Ballistics Research Laboratory until 1949, one could argue that ENIAC was the first computer to use a stored program. John von Neumann also designed the instruction set for the modified ENIAC, and he should be given credit for this. The stored program version of ENIAC ran 6 times slower, but it was still entirely I/O bound, and programs could be developed and debugged in days rather than weeks, which is one of the advantages of having stored programs.