Alan Turing

Printer-friendly versionPrinter-friendly version

From Prime Numbers to Nuclear Physics and Beyond

After his teatime conversation with Hugh Montgomery, Freeman Dyson wrote this letter to Atle Selberg with references showing that the pair-correlation of the zeros of the zeta function is identical to that of the eigenvalues of a random matrix.

In early April 1972, Hugh Montgomery, who had been a Member in the School of Mathematics the previous year, stopped by the Institute to share a new result with Atle Selberg, a Professor in the School. The discussion between Montgomery and Selberg involved Montgomery’s work on the zeros of the Riemann zeta function, which is connected to the pattern of the prime numbers in number theory. Generations of mathematicians at the Institute and elsewhere have tried to prove the Riemann Hypothesis, which conjectures that the non-trivial zeros (those that are not easy to find) of the Riemann zeta function lie on the critical line with real part equal to 1⁄2.

Montgomery had found that the statistical distribution of the zeros on the critical line of the Riemann zeta function has a certain property, now called Montgomery’s pair correlation conjecture. He explained that the zeros tend to repel between neighboring levels. At teatime, Montgomery mentioned his result to Freeman Dyson, Professor in the School of Natural Sciences.

In the 1960s, Dyson had worked on random matrix theory, which was proposed by physicist Eugene Wigner in 1951 to describe nuclear physics. The quantum mechanics of a heavy nucleus is complex and poorly understood. Wigner made a bold conjecture that the statistics of the energy levels could be captured by random matrices. Because of Dyson’s work on random matrices, the distribution or the statistical behavior of the eigenvalues of these matrices has been understood since the 1960s.

READ MORE>

'An Artificially Created Universe': The Electronic Computer Project at IAS

By George Dyson 

In this 1953 diagnostic photograph from the maintenance logs of the IAS Electronic Computer Project (ECP), a 32-by-32 array of charged spots––serving as working memory, not display––is visible on the face of a Williams cathode-ray memory tube. Starting in late 1945, John von Neumann, Professor in the School of Mathematics, and a group of engineers worked at the Institute to design, build, and program an electronic digital computer.

I am thinking about something much more important than bombs. I am thinking about computers.––John von Neumann, 1946 

 

There are two kinds of creation myths: those where life arises out of the mud, and those where life falls from the sky. In this creation myth, computers arose from the mud, and code fell from the sky.
 
In late 1945, at the Institute for Advanced Study in Princeton, New Jersey, Hungarian-American mathematician John von Neumann gathered a small group of engineers to begin designing, building, and programming an electronic digital computer, with five kilobytes of storage, whose attention could be switched in 24 microseconds from one memory location to the next. The entire digital universe can be traced directly to this 32-by-32-by-40-bit nucleus: less memory than is allocated to displaying a single icon on a computer screen today.
 
Von Neumann’s project was the physical realization of Alan Turing’s Universal Machine, a theoretical construct invented in 1936. It was not the first computer. It was not even the second or third computer. It was, however, among the first compu­ters to make full use of a high-speed random-access storage matrix, and became the machine whose coding was most widely replicated and whose logical architecture was most widely reproduced. The stored-program computer, as conceived by Alan Turing and delivered by John von Neumann, broke the distinction between numbers that mean things and numbers that do things. Our universe would never be the same. 
 
READ MORE>
Syndicate content