description: paper by Alan Turing, foundational to theoretical computer science
54 results
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 Michal Zalewski · 4 Apr 2005 · 412pp · 104,864 words
] [102] [103] [104] [105] Chapter 15 [106] [107] Chapter 16 [108] [109] Chapter 17 [110] [111] [112] Chapter 18 [113] [114] [115] * * * [41] Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society, Series 2, 42 (1936). [42] R.L. Rivest, A. Shamir, L. Adleman, “A Method for Obtaining
by Ray Kurzweil · 14 Jul 2005 · 761pp · 231,902 words
in his "Uberformal unenscheiderbare Satze der Principia Mathematica und verwandter Systeme I," Monatshefte für Mathematik und Physik 38 (1931): 173–98. 28. Alan M. Turing, "On Computable Numbers with an Application to the Entscheidungsproblem," Proceedings of the London Mathematical Society 42 (1936): 230-65. The "Entscheidungsproblem" is the decision or halting problem—that is, how to
by George Zarkadakis · 7 Mar 2016 · 405pp · 117,219 words
cybernetics in the summer of 1956 with its inaugural conference in Dartmouth, New Hampshire, one year before von Neumann’s death. 8Turing, A. M. (1936), ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, Proceedings of the London Mathematical Society, 2 (1937), 42, pp. 230–65. 9To be more accurate, Gödel encoded metamathematical statements within ordinary
…
that we can never know everything about a quantum phenomenon. Therefore, nature will remain forever at least partially unknown to us. 16Turing, A. M. (1936), ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, in: Proceedings of the London Mathematical Society, 1937, Vol. 2, No. 42, pp. 230–65. 17The American mathematician Alonzo Church independently published
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 David A. Mindell · 10 Oct 2002 · 759pp · 166,687 words
1946): 1–47. Tomayko, James E. “Helmut Hoelzer’s Fully Electronic Analog Computer.” Annals of the History of Computing 7 (1985): 227–40. Turing, Alan. “On Computable Numbers, with an Application to the Entscheidungsproblem.” Proceedings of the London Mathematical Society 2, no. 42 (1937): 230–65. U.S. Naval Academy. Fire Control Installations . United States Naval
by Stuart Russell and Peter Norvig · 14 Jul 2019 · 2,466pp · 668,761 words
. Turian, J., Ratinov, L., and Bengio, Y. (2010). Word representations: a simple and general method for semi-supervised learning. In ACL-10. Turing, A. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proc. London Mathematical Society, 2nd series, 42, 230–265. Turing, A. (1948). Intelligent machinery. Tech. rep., National Physical Laboratory. reprinted in (Ince
by James Bridle · 6 Apr 2022 · 502pp · 132,062 words
M. Lewis (eds), New Media Language (London: Routledge, 2003), pp. 85–94. 6. NON-BINARY MACHINES 1. Plato, Apology, 21a–d. 2. A. M. Turing, ‘On Computable Numbers, With an Application to the Entscheidungsproblem’ (1936), Proceedings of the London Mathematical Society, Series 2, 42, 1937, pp. 230–65; DOI:10.1112/plms/s2-42.1.230
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 Steven Pinker · 24 Sep 2012 · 1,351pp · 385,579 words
, G. R. & Lambert, W. E. 1969. White and Negro listeners’ reactions to various American-English dialects. Social Forces, 47, 465–68. Turing, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230–65. Turing, A. M. 1950. Computing machinery and intelligence. Mind, 59, 433–60. Turkheimer
by Ananyo Bhattacharya · 6 Oct 2021 · 476pp · 121,460 words
by Walter Isaacson · 6 Oct 2014 · 720pp · 197,129 words
by Stephen Hawking · 28 Mar 2007
by Martin Campbell-Kelly and Nathan Ensmenger · 29 Jul 2013 · 528pp · 146,459 words
by Melanie Mitchell · 31 Mar 2009 · 524pp · 120,182 words
by Howard Rheingold · 14 May 2000 · 352pp · 120,202 words
by Erik J. Larson · 5 Apr 2021
by Chris Hanson and Gerald Sussman · 17 Feb 2021
by M. Mitchell Waldrop · 14 Apr 2001
by Jane Smiley · 18 Oct 2010 · 253pp · 80,074 words
by Cade Metz · 15 Mar 2021 · 414pp · 109,622 words
by Vikram Chandra · 7 Nov 2013 · 239pp · 64,812 words
by Ray Kurzweil · 31 Dec 1998 · 696pp · 143,736 words
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by David Golumbia · 31 Mar 2009 · 268pp · 109,447 words
by Paul Sen · 16 Mar 2021 · 444pp · 111,837 words
by Stuart Russell · 7 Oct 2019 · 416pp · 112,268 words
by Scott J. Shapiro · 523pp · 154,042 words
by Keith Houston · 22 Aug 2023 · 405pp · 105,395 words
by John Brockman · 5 Oct 2015 · 481pp · 125,946 words
by Ray Kurzweil · 13 Nov 2012 · 372pp · 101,174 words
by George Gilder · 16 Jul 2018 · 332pp · 93,672 words
by Paul J. Nahin · 27 Oct 2012 · 229pp · 67,599 words
by Kenneth Payne · 16 Jun 2021 · 339pp · 92,785 words
by Lance Fortnow · 30 Mar 2013 · 236pp · 50,763 words
by George Dyson · 6 Mar 2012
by Noam Chomsky · 24 Feb 2012
by Brian Christian · 1 Mar 2011 · 370pp · 94,968 words
by George Dyson · 28 Mar 2012 · 463pp · 118,936 words
by Daniel C. Dennett · 7 Feb 2017 · 573pp · 157,767 words
by Eric Topol · 1 Jan 2019 · 424pp · 114,905 words
by John Brockman · 19 Feb 2019 · 339pp · 94,769 words
by Amy Webb · 5 Mar 2019 · 340pp · 97,723 words
by Robert C. Martin · 13 Oct 2019 · 333pp · 64,581 words
by Ben Tarnoff · 13 Jun 2022 · 234pp · 67,589 words
by Nicole Kobie · 3 Jul 2024 · 348pp · 119,358 words
by Paul Davies · 31 Jan 2019 · 253pp · 83,473 words
by David Berlinski · 2 Jan 2005 · 158pp · 49,168 words
by Chris Bernhardt · 12 May 2016 · 210pp · 62,771 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 Stephen M Fleming · 27 Apr 2021
by Michael Smith · 30 Oct 2011 · 440pp · 109,150 words