description: paper by Alan Turing, foundational to theoretical computer science
53 results
by M. Mitchell Waldrop · 14 Apr 2001
Jay W. Forrester)." Annals of the H15tory ofComputzng 5 (1983). -. "Origin of the Term Bit." Annals of the History ofComputzng 6 (1984). Turing, Alan M. "On Computable Numbers, with an ApplIcation to the Entschldungsproblem." Pro- ceedzngs of the London Mathematical Soczety 2, no. 42 (1937). -. "Computing Machinery and Intelligence." Mind 59, no. 236 (1950). Reprinted In
by Howard Rheingold · 14 May 2000 · 352pp · 120,202 words
Turing was getting at. These systems are now known as "universal Turing machines." The theory was first stated in a paper with the forbidding title "On Computable Numbers, with an application to the Entscheidungsproblem." The Turing Machine was a hypothetical device Turing invented on the way to settling a critical question about the foundations of mathematics
…
(Washington: U.S. Government Printing Office, 1965), 30-31. [12] Ibid., 31. Chapter Three: The First Hacker and his Imaginary Machine [1] Alan M. Turing, "On Computable Numbers, with an Application to the Entscheidungsproblem," Proceedings of the London Mathematical Society, second series, vol. 42, part 3, November 12, 1936, 230-265. [2] An amusing example of
by George Gilder · 16 Jul 2018 · 332pp · 93,672 words
Intelligence (New York: Alfred A. Knopf, 2017). Turner, Fred. Burning Man at Google: A Cultural Infrastructure for New Media Production (Sage Journal, 2009). Turing, Alan. “On Computable Numbers, With An Application to the Entscheidungsproblem” (Princeton: Princeton Graduate Press, 1936). Turing, Alan. Systems of Logic, edited and introduced by Andrew W. Appel (Princeton, NJ: Princeton University Press
by Erik J. Larson · 5 Apr 2021
. Chapter 1: The Intelligence Error 1. A. M. Turing, “Computing Machinery and Intelligence,” Mind 59, no. 236 (October 1950), 433–460. 2. A. M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society, vols. 2–42, issue 1 (January 1937), 230–265. 3. A. M. Turing, Systems of Logic
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 Martin Campbell-Kelly and Nathan Ensmenger · 29 Jul 2013 · 528pp · 146,459 words
, and graduated in mathematics with the highest honors in 1934. He became a Fellow of King’s College and, in 1936, published his classic paper “On Computable Numbers with an Application to the Entscheidungsproblem” in which he described the Turing Machine. Turing showed that not all mathematical questions were decidable, and that one could not always
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 Stephen Hawking · 28 Mar 2007
distinction. These accomplishments earned him a stipend to do postgraduate work at King’s and this led to his greatest mathematical achievement: his 1936 paper On Computable Numbers, With an Application to the Entscheidungsproblem, reproduced here. In 1928, the German mathematician David Hilbert, the greatest mathematician alive, repeated three challenges to the world of mathematics that
…
cracked the Nazi’s enigma code in World War II. However, Turing had proven that no machine would ever be able to decide this question. ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM [RECEIVED 28 MAY, 1936.—READ 12 NOVEMBER, 1936.] The “computable” numbers may be described briefly as the real numbers whose expressions as
…
is scanned, and that the m-configuration has the number t; then we may represent this complete configuration by the formula ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM. A CORRECTION In a paper entitled “On computable numbers, with an application to the Entscheidungsproblem”[1] the author gave a proof of the insolubility of the Entscheidungsproblem of the “engere Funktionenkalkül”. This
…
magnitudes, 48–50 of a ratio, 25 compounded ratios, 55–60 compounded system, 1093, 1096 compound event, 852 compound functions, 671 compound symbols, elimination, 924 On Computable Numbers, with an Application to the Entscheidungsproblem (Turing), 1293–1294 Abbreviated Tables, 1298–1301 Application of the Diagonal Process, 1307–1309 Application to the Entscheidungsproblem, 1318–1321 Automatic Machines
…
trilateral figures, 8 Trinity College, 366 triplicate ratio, 25 true objects, 841 propositions, 966–967, 977 roots, distinguishing, 349 Turing, Alan Mathison biography, 1285–1292 On Computable Numbers, with an Application to the Entscheidungsproblem, 1293–1294 Abbreviated Tables, 1298–1301 Application of the Diagonal Process, 1307–1309 Application to the Entscheidungsproblem, 1318–1321 Automatic Machines, 1295
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 Walter Isaacson · 6 Oct 2014 · 720pp · 197,129 words
’s third challenge all dealt blows to a mechanical, deterministic, predictable universe. Turing’s paper was published in 1937 with the not so snappy title “On Computable Numbers, with an Application to the Entscheidungsproblem.” His answer to Hilbert’s third question was useful for the development of mathematical theory. But far more important was the by
…
Obama, Barack, ref1 Office of Defense Mobilization, ref1 Office of Scientific Research, ref1 Ohm’s Law, ref1 oil, ref1 Olsen, Ken, ref1 Olson, Judith, ref1 “On Computable Numbers, with an Application to the Entscheidungsproblem“ (Turing), ref1, ref2 On Distributed Communications (Baran), ref1 One Flew Over the Cuckoo’s Nest (Kesey), ref1 online communities, ref1 oNLine System
by Michal Zalewski · 4 Apr 2005 · 412pp · 104,864 words
by David Golumbia · 31 Mar 2009 · 268pp · 109,447 words
by Chris Hanson and Gerald Sussman · 17 Feb 2021
by Keith Houston · 22 Aug 2023 · 405pp · 105,395 words
by Jane Smiley · 18 Oct 2010 · 253pp · 80,074 words
by Scott J. Shapiro · 523pp · 154,042 words
by George Zarkadakis · 7 Mar 2016 · 405pp · 117,219 words
by Amy Webb · 5 Mar 2019 · 340pp · 97,723 words
by Steven Pinker · 24 Sep 2012 · 1,351pp · 385,579 words
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by Daniel C. Dennett · 7 Feb 2017 · 573pp · 157,767 words
by Noam Chomsky · 24 Feb 2012
by Paul J. Nahin · 27 Oct 2012 · 229pp · 67,599 words
by George Dyson · 28 Mar 2012 · 463pp · 118,936 words
by David A. Mindell · 10 Oct 2002 · 759pp · 166,687 words
by Ray Kurzweil · 31 Dec 1998 · 696pp · 143,736 words
by Stuart Russell · 7 Oct 2019 · 416pp · 112,268 words
by John Brockman · 19 Feb 2019 · 339pp · 94,769 words
by James Bridle · 6 Apr 2022 · 502pp · 132,062 words
by Ben Tarnoff · 13 Jun 2022 · 234pp · 67,589 words
by Nicole Kobie · 3 Jul 2024 · 348pp · 119,358 words
by Ananyo Bhattacharya · 6 Oct 2021 · 476pp · 121,460 words
by Paul Sen · 16 Mar 2021 · 444pp · 111,837 words
by Brian Christian and Tom Griffiths · 4 Apr 2016 · 523pp · 143,139 words
by Lance Fortnow · 30 Mar 2013 · 236pp · 50,763 words
by Vikram Chandra · 7 Nov 2013 · 239pp · 64,812 words
by Chris Bernhardt · 12 May 2016 · 210pp · 62,771 words
by Robert C. Martin · 13 Oct 2019 · 333pp · 64,581 words
by Melanie Mitchell · 31 Mar 2009 · 524pp · 120,182 words
by Paul Davies · 31 Jan 2019 · 253pp · 83,473 words
by John Brockman · 5 Oct 2015 · 481pp · 125,946 words
by James Gleick · 1 Mar 2011 · 855pp · 178,507 words
by Werner Loewenstein · 29 Jan 2013 · 362pp · 97,862 words
by Eric Topol · 1 Jan 2019 · 424pp · 114,905 words
by Kenneth Payne · 16 Jun 2021 · 339pp · 92,785 words
by Tom Chivers · 12 Jun 2019 · 289pp · 92,714 words
by Ray Kurzweil · 13 Nov 2012 · 372pp · 101,174 words
by Brian Christian · 1 Mar 2011 · 370pp · 94,968 words
by Cade Metz · 15 Mar 2021 · 414pp · 109,622 words
by David Berlinski · 2 Jan 2005 · 158pp · 49,168 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