Kurt Godel

Printer-friendly versionPrinter-friendly version

'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>

Can the Continuum Hypothesis be Solved?

By Juliette Kennedy 

The continuum hypothesis was under discussion as an "undecidable statement" at the Princeton University Bicentennial Conference on "Problems of Mathematics" in 1946, the first major international gathering of mathematicians after World War II. Kurt Gödel is in the second row, fifth from left.

In 1900, David Hilbert published a list of twenty-three open questions in mathematics, ten of which he presented at the International Congress of Mathematics in Paris that year. Hilbert had a good nose for asking mathematical questions as the ones on his list went on to lead very interesting mathematical lives. Many have been solved, but some have not been, and seem to be quite difficult. In both cases, some very deep mathematics has been developed along the way. The so-called Riemann hypothesis, for example, has withstood the attack of generations of mathematicians ever since 1900 (or earlier). But the effort to solve it has led to some beautiful mathematics. Hilbert’s fifth problem turned out to assert something that couldn’t be true, though with fine tuning the “right” question—that is, the question Hilbert should have asked—was both formulated and solved. There is certainly an art to asking a good question in mathematics.

The problem known as the continuum hypothesis has had perhaps the strangest fate of all. The very first problem on the list, it is simple to state: how many points on a line are there? Strangely enough, this simple question turns out to be deeply intertwined with most of the interesting open problems in set theory, a field of mathematics with a very general focus, so general that all other mathematics can be seen as part of it, a kind of foundation on which the house of mathematics rests. Most objects in mathematics are infinite, and set theory is indeed just a theory of the infinite.

READ MORE>
Syndicate content