description: paper by Alan Turing, foundational to theoretical computer science
56 results
by Nigel Toon · 13 Dec 2023
York, 1986), pp. 144–95. The original German with a facing English translation, preceded by an introductory note by Stephen Cole Kleene. 6Turing, A. M. ‘On computable numbers, with an application to the Entscheidungsproblem’, Proceedings of the London Mathematical Society, 42: 1 (1937), pp. 230–65 7For Steve Jobs talking about computers as bicycles for the
…
38, number 8, April 19, 1965, pp. 114 ff. in IEEE Solid-State Circuits Society Newsletter, 11: 3 (2006), pp. 33–5 4Turing, A. M. ‘On computable numbers, with an application to the Entscheidungsproblem’, Proceedings of the London Mathematical Society, 42: 1 (1937), pp. 230–65 5Einstein and Infeld, op. cit. 6For a comprehensive list of
by Jacob Siegel · 24 Mar 2026 · 348pp · 103,246 words
same parts and followed the same rules as physical machines, and it could perform the same calculations. But as Turing proved in his 1937 essay “On Computable Numbers, with an Application to the Entscheidungsproblem,” there remained a set of problems that were technically impossible to solve. This was the Entscheidungsproblem, also known as the “decision problem
by George Dyson · 6 Mar 2012
. To an observer in the digital universe, our universe appears to be slowing down. Universal codes and universal machines, introduced by Alan Turing in his “On Computable Numbers, with an Application to the Entscheidungsproblem” of 1936, have prospered to such an extent that Turing’s underlying interest in the “decision problem” is easily overlooked. In answering
…
with which one is herded can easily be ignored.”2 Turing’s arrival in Princeton was followed, five days later, by the proofs of his “On Computable Numbers, with an Application to the Entscheidungsproblem.” These thirty-five pages would lead the way from logic to machines. Alan Mathison Turing was born at Warrington Lodge, London, on
…
from this day forth Alan became one of Max’s principle protégés,” says William Newman, Max’s son. Max Newman lobbied for the publication of “On Computable Numbers, with an Application to the Entscheidungsproblem,” in the Proceedings of the London Mathematical Society, and arranged for Turing to go to Princeton to work with Alonzo Church. “This
…
Ideas in 1936,” in Rolf Herken, ed., The Universal Turing Machine: A Half-Century Survey (Oxford: Oxford University Press, 1988), p. 85. 11. Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society, ser. 2, vol. 42 (1936–1937): 230. 12. Ibid., p. 231. 13. Ibid., p. 250. 14
…
Davis, “Influences of Mathematical Logic on Computer Science,” in Herken, ed., The Universal Turing Machine, p. 315. 18. Alonzo Church, “Review of A.M. Turing, ‘On Computable Numbers, with an Application to the Entscheidungsproblem,’ ” Journal of Symbolic Logic 2, no. 1 (March 1937): 43. 19. Kurt Gödel, “Remarks Before the Princeton Bicentennial Conference on Problems in
…
’s College Archive, Cambridge; courtesy of the Turing family) John von Neumann at age seven. (Nicholas Vonneumann and Marina von Neumann Whitman) Alan Turing’s “On Computable Numbers, with an Application to the Entscheidungsproblem” was published in the Proceedings of the London Mathematical Society shortly after Turing’s arrival in Princeton in 1936. The Institute for
by Ananyo Bhattacharya · 6 Oct 2021 · 476pp · 121,460 words
asked von Neumann to write him a letter of recommendation. Five days later, working in an office in Fine Hall, Turing received the proofs for ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, the paper that laid the theoretical foundations of modern computer science.7 He was disappointed by its reception in Princeton. But one
…
. 138–56. 6. Garrett Birkhoff, 1958, ‘Von Neumann and Lattice Theory’, Bulletin of the American Mathematical Society, 64 (1958), pp. 50–56. 7. Alan Turing, ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, published in two parts 1936–7, Proceedings of the London Mathematical Society, 42(1) (1937), pp. 230–65. 8. Interview with Herman
…
Project Office of Scientific Research and Development 77 ‘On Certain Equations of Economics and a Generalization of Brouwer’s Fixed-Point Theorem’ (von Neumann) 148 ‘On Computable Numbers, with an Application to the Entscheidungsproblem’ (Turing) 70, 121 On Thermonuclear War (Kahn) 219–20 Oncken, Wilhelm 4 Operation Crossroads 98 operations research 188, 189 operator theory 61
…
, 318n38 Turing, Alan 46 acquaintance with VN 70, 103 Automatic Computing Engine (ACE) 121, 125 first paper 70 influence on VN 121, 301n22 myth 121 ‘On Computable Numbers, with an Application to the Entscheidungsproblem’ 70, 121 PhD 118 at Princeton 70 solution to Hilbert’s Entscheidungsproblem 118–21 universal computing machine 79–80, 306–7n35, 307n37
by Chris Hanson and Gerald Sussman · 17 Feb 2021
: MIT Press, 2013. [123]The TTL Data Book for Design Engineers, by the Engineering Staff of Texas Instruments Incorporated, Semiconductor Group. [124]Alan M. Turing; “On Computable Numbers, with an Application to the Entscheidungsproblem,” in Proceedings of the London Mathematical Society (Series 2), 42 (1936): 230–265. [125]David L. Waltz; Generating Semantic Descriptions From Drawings
by Jane Smiley · 18 Oct 2010 · 253pp · 80,074 words
between abstract symbols and the physical world. Indeed, his imagery was, for Cambridge, almost shockingly industrial.” In May 1936, Alan Turing submitted his paper, entitled “On Computable Numbers, with an Application to the Entscheidungsproblem,” to the Proceedings of the London Mathematical Society and then applied unsuccessfully for a Procter Fellowship at Princeton. As far as anyone
by James Gleick · 1 Mar 2011 · 855pp · 178,507 words
, Cambridge, when he presented his computable-numbers paper to his professor in 1936. The full title finished with a flourish in fancy German: it was “On Computable Numbers, with an Application to the Entscheidungsproblem.” The “decision problem” was a challenge that had been posed by David Hilbert at the 1928 International Congress of Mathematicians. As perhaps
…
H. A. Newman to Alonzo Church, 31 May 1936, quoted in Andrew Hodges, Alan Turing, 113. ♦ “THE JUSTIFICATION … LIES IN THE FACT”: Alan M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society 42 (1936): 230–65. ♦ “IT WAS ONLY BY TURING’S WORK”: Kurt Gödel to Ernest Nagel
…
the Computer Age. Mill Valley, Calif.: Strawberry Press, 1998. Tufte, Edward R. “The Cognitive Style of PowerPoint.” Cheshire, Conn.: Graphics Press, 2003. Turing, Alan M. “On Computable Numbers, with an Application to the Entscheidungsproblem.” Proceedings of the London Mathematical Society 42 (1936): 230–65. ———. “Computing Machinery and Intelligence.” Minds and Machines 59, no. 236 (1950): 433
by Brian Christian and Tom Griffiths · 4 Apr 2016 · 523pp · 143,139 words
, Adams Media, 2006. it was the halting problem that inspired Turing: Alan Turing considers the halting problem and proposes the Turing machine in “On Computable Numbers, with an Application to the Entscheidungsproblem” and “On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction.” “poker players call it ‘leveling’”: Dan Smith, personal interview, September 11, 2014. “You don’t have deuce–seven
…
and Get More Done in Less Time. Oakland, CA: Berrett-Koehler, 2007. Turing, Alan M. “On Computable Numbers, with an Application to the Entscheidungsproblem.” Read November 12, 1936. Proceedings of the London Mathematical Society s2-42, no. 1 (1937): 230–265. ______. “On Computable Numbers, with an Application to the Entscheidungsproblem: A Correction.” Proceedings of the London Mathematical Society s2-43, no. 1
by Amy Webb · 5 Mar 2019 · 340pp · 97,723 words
in the 1930s with the publication of two seminal papers: Claude Shannon’s “A Symbolic Analysis of Switching and Relay Circuits” and Alan Turing’s “On Computable Numbers, with an Application to the Entscheidungsproblem.” As an electrical engineering student at MIT, Shannon took an elective course in philosophy—an unusual diversion. Boole’s An Investigation of
…
and technology research budget cuts, 243 Turing, Alan, 24–25, 26, 27–29, 30, 31, 35, 259; morphogenesis theory, 204; neural network concept, 27–29;“On Computable Numbers, With an Application to the Entscheidungsproblem,” 24. See also Turing Test Turing test, 27–28, 50, 146, 169, 184 Turriano, Juanelo: mechanical monk creation of, 18, 25 Tversky
by Melanie Mitchell · 31 Mar 2009 · 524pp · 120,182 words
proved that there are undecidable statements in mathematics, but Turing’s results ended up being more influential. “his answer, again, was ‘no’ ”: Turing, A. M., On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2(42), 1936, pp. 230–265. “According to his biographer Hao Wang”: Wang, H., Reflections on
…
. Becoming Human: Evolution and Human Uniqueness. New York: Harvest Books, 1999. Travis, J. Eye-opening gene. Science News Online, May 10, 1997. Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2(42), 1936, pp. 230–265. Ulam, S. M. and von Neumann, J. On combination of
by Stuart Russell · 7 Oct 2019 · 416pp · 112,268 words
by David Golumbia · 31 Mar 2009 · 268pp · 109,447 words
by Michal Zalewski · 4 Apr 2005 · 412pp · 104,864 words
by Paul Davies · 31 Jan 2019 · 253pp · 83,473 words
by George Dyson · 28 Mar 2012 · 463pp · 118,936 words
by Erik J. Larson · 5 Apr 2021
by Stuart Russell and Peter Norvig · 14 Jul 2019 · 2,466pp · 668,761 words
by Vikram Chandra · 7 Nov 2013 · 239pp · 64,812 words
by George Gilder · 16 Jul 2018 · 332pp · 93,672 words
by Paul J. Nahin · 27 Oct 2012 · 229pp · 67,599 words
by Ray Kurzweil · 14 Jul 2005 · 761pp · 231,902 words
by Noam Chomsky · 24 Feb 2012
by Stephen Hawking · 28 Mar 2007
by M. Mitchell Waldrop · 14 Apr 2001
by Walter Isaacson · 6 Oct 2014 · 720pp · 197,129 words
by Eric Topol · 1 Jan 2019 · 424pp · 114,905 words
by Martin Campbell-Kelly and Nathan Ensmenger · 29 Jul 2013 · 528pp · 146,459 words
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by David A. Mindell · 10 Oct 2002 · 759pp · 166,687 words
by John Brockman · 19 Feb 2019 · 339pp · 94,769 words
by Robert C. Martin · 13 Oct 2019 · 333pp · 64,581 words
by Howard Rheingold · 14 May 2000 · 352pp · 120,202 words
by Cade Metz · 15 Mar 2021 · 414pp · 109,622 words
by James Bridle · 6 Apr 2022 · 502pp · 132,062 words
by Scott J. Shapiro · 523pp · 154,042 words
by Keith Houston · 22 Aug 2023 · 405pp · 105,395 words
by Ben Tarnoff · 13 Jun 2022 · 234pp · 67,589 words
by Daniel C. Dennett · 7 Feb 2017 · 573pp · 157,767 words
by Jill Lepore · 24 Aug 2026 · 363pp · 122,400 words
by Ray Kurzweil · 13 Nov 2012 · 372pp · 101,174 words
by Ray Kurzweil · 31 Dec 1998 · 696pp · 143,736 words
by Lance Fortnow · 30 Mar 2013 · 236pp · 50,763 words
by Brian Christian · 1 Mar 2011 · 370pp · 94,968 words
by Steven Pinker · 24 Sep 2012 · 1,351pp · 385,579 words
by George Zarkadakis · 7 Mar 2016 · 405pp · 117,219 words
by Chris Bernhardt · 12 May 2016 · 210pp · 62,771 words
by John Brockman · 5 Oct 2015 · 481pp · 125,946 words
by Kenneth Payne · 16 Jun 2021 · 339pp · 92,785 words
by Paul Sen · 16 Mar 2021 · 444pp · 111,837 words
by David Berlinski · 2 Jan 2005 · 158pp · 49,168 words
by Nicole Kobie · 3 Jul 2024 · 348pp · 119,358 words
by Werner Loewenstein · 29 Jan 2013 · 362pp · 97,862 words
by Tom Chivers · 12 Jun 2019 · 289pp · 92,714 words
by Robert Harris · 15 Feb 2011 · 387pp · 111,096 words
by Michael Smith · 30 Oct 2011 · 440pp · 109,150 words
by Stephen M Fleming · 27 Apr 2021