Epstein Secrets

by Google and the NSA, is the realization of what Alan Turing was getting at, in 1939, when he wondered

ear-old graduate student, not by building a computer, but by writing a purely mathematical paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," published in 1936. The Decision Problem, articulated by Gottingen's David Hilbert, concerned the abstract mathematical question of whether there

E_OVERSIGHT_015898 Chapter 10 TURING’S MACHINE Alan Turing HOUSE_OVERSIGHT_015899 ‘A computer would

at King’s College, Cambridge and was made a Fellow at only 22. In 1936 Turing, aged 24, published On Computable Numbers and their Application to the Entscheidungsproblem, not a snappy title, but one of the most influential mathematical works of the 20" century. The paper described the new the science of computing and

Brain. Reprint. Picador, 2008. Singh, Simon. The Code Book: The Secret History of Codes and Code-Breaking. (Reissue). Fourth Estate, 2002. Turing, Alan. “Checking a Large Routine?’ In The Early British Computer Conferences, 70-72. MIT Press, 1989. http://dl.acm.org/citation. HOUSE_OVERSIGHT_016079

rly Journal of Mechanics and Applied Mathematics 1, no. 1 (1948): 287-308. Turing, Alan Mathison. “On Computable Numbers, with an Application to the Entscheidungsproblem.” J. of Math 58 (1936): 345-63. ———. “Systems of Logic Based on Ordinals.” Proceedings of the London Mathematical Society 2, no. 1 (1939): 161-228.

nd Atoms. He is the author of AB, co-author (with Alan Gershenfeld & Joel Cutcher-Gershenfeld) of Design

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu

nd Atoms. He is the author of AB, co-author (with Alan Gershenfeld & Joel Cutcher-Gershenfeld) of Design

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu