HS Rare Books company logo
HS Rare Books
Skip to main content
  • Menu
  • Artworks
  • Notable Sales
  • Exhibitions
  • Selling your books
  • Contact
Menu
Artworks

Books & Manuscripts

Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.
Turing, Alan Mathison, “On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “On computable numbers, with an application to the Entscheidungsproblem. A correction,” vol. 43, part 7 , (30 December 1937), pp. 544–546. London, 1936–1937.

Turing, Alan Mathison

“On computable numbers, with an application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, second series, vol. 42, part 3 (30 November 1936), pp. 230–240; vol. 42, part 4 (23 December 1936), pp. 241–265; together with “O, (30 December 1937), pp. 544–546. London, 1936–1937.
The foundations of modern computing: Turing’s universal machine and the mathematical definition of computation

First edition of one of the foundational papers of theoretical computer science, introducing the universal computing machine and a precise mathematical account of effective computation, and establishing limits to what can be decided by an algorithm. Offered with Turing’s separately published correction of 1937.
P.O.R.
Enquire
%3Cdiv%20class%3D%22artist%22%3ETuring%2C%20Alan%20Mathison%3C/div%3E%3Cdiv%20class%3D%22title_and_year%22%3E%3Cspan%20class%3D%22title_and_year_title%22%3E%E2%80%9COn%20computable%20numbers%2C%20with%20an%20application%20to%20the%20Entscheidungsproblem.%E2%80%9D%20In%3A%20Proceedings%20of%20the%20London%20Mathematical%20Society%2C%20second%20series%2C%20vol.%2042%2C%20part%203%20%2830%20November%201936%29%2C%20pp.%20230%E2%80%93240%3B%20vol.%2042%2C%20part%204%20%2823%20December%201936%29%2C%20pp.%20241%E2%80%93265%3B%20together%20with%20%E2%80%9CO%3C/span%3E%2C%20%3Cspan%20class%3D%22title_and_year_year%22%3E%2830%20December%201937%29%2C%20pp.%20544%E2%80%93546.%20London%2C%201936%E2%80%931937.%20%3C/span%3E%3C/div%3E%3Cdiv%20class%3D%22medium%22%3EThe%20foundations%20of%20modern%20computing%3A%20Turing%E2%80%99s%20universal%20machine%20and%20the%20mathematical%20definition%20of%20computation%3Cbr/%3E%0A%3Cbr/%3E%0AFirst%20edition%20of%20one%20of%20the%20foundational%20papers%20of%20theoretical%20computer%20science%2C%20introducing%20the%20universal%20computing%20machine%20and%20a%20precise%20mathematical%20account%20of%20effective%20computation%2C%20and%20establishing%20limits%20to%20what%20can%20be%20decided%20by%20an%20algorithm.%20Offered%20with%20Turing%E2%80%99s%20separately%20published%20correction%20of%201937.%3C/div%3E

Further images

  • (View a larger image of thumbnail 1 ) Thumbnail of additional image
  • (View a larger image of thumbnail 2 ) Thumbnail of additional image
  • (View a larger image of thumbnail 3 ) Thumbnail of additional image
  • (View a larger image of thumbnail 4 ) Thumbnail of additional image
  • (View a larger image of thumbnail 5 ) Thumbnail of additional image
  • (View a larger image of thumbnail 6 ) Thumbnail of additional image
  • (View a larger image of thumbnail 7 ) Thumbnail of additional image
  • (View a larger image of thumbnail 8 ) Thumbnail of additional image
  • (View a larger image of thumbnail 9 ) Thumbnail of additional image
  • (View a larger image of thumbnail 10 ) Thumbnail of additional image
  • (View a larger image of thumbnail 11 ) Thumbnail of additional image

Three parts, 4to (259 × 175 mm). Original gray-green printed wrappers, rebacked; front wrapper of Part 1 repaired along the upper edge with tape on verso, four other small marginal tears repaired, and slight toning to edges; front wrapper of Part 2 with two small nicks to edges and slight toning; front wrapper of Part 3 with tape repair to upper corner and slight toning to edges; preserved in a cloth box. Interiors clean and bright, with a small spot of glue residue, a few small ink marks, and a small nick to the upper edge of the first leaf of Part 1.


Alan Turing’s (1912–1954) paper arose from one of the central questions of mathematical logic. David Hilbert and Wilhelm Ackermann had formulated the Entscheidungsproblem, asking whether there could be a general, mechanical procedure for deciding the validity of statements in a formal logical system. At Cambridge, Turing encountered the problem through lectures given by Max Newman and devised a strikingly concrete way to address it.


Rather than beginning with a particular formal calculus, Turing described an idealized computing device operating by a finite set of instructions on symbols written on a tape. These machines, subsequently known as Turing machines, supplied a rigorous model of what it means to perform a calculation by a definite procedure. His most consequential insight was the universal machine: a single machine capable, when supplied with a suitable description, of carrying out the operations of any machine of the specified kind. This conceptual separation of machine and instructions became fundamental to the theory of general-purpose computing.


Using this model, Turing demonstrated that there can be no universal algorithm for resolving every problem of the relevant logical kind, thereby giving a negative answer to the Entscheidungsproblem. His argument also established that there are well-defined numbers and mathematical questions that cannot be computed or settled by such a procedure. The paper thus described both the reach and the inherent limitations of mechanized calculation.


Alonzo Church had independently obtained a negative solution to the Entscheidungsproblem through his work on the lambda calculus, published shortly before Turing’s paper. Turing’s achievement remained distinctive: his machine model offered an unusually transparent account of computation in operational terms. The equivalence of these approaches helped give rise to what is now called the Church–Turing thesis, the proposition that effectively calculable functions are precisely those computable by a Turing machine.


The 1937 correction, included here in its original journal part, addresses a technical issue in the argument and forms an integral part of the publication history of the work. Its presence alongside the two 1936 parts makes this a particularly coherent presentation of Turing’s original contribution.


Although Turing’s abstract machine was not a blueprint for a particular computer, the concept of universal computation furnished a central theoretical foundation for the subsequent development of stored-program electronic computers. Turing himself later contributed directly to computing projects, notably the design of the Automatic Computing Engine, and went on to explore the question of machine intelligence in his influential 1950 paper.


Few twentieth-century mathematical papers have had comparable consequences across logic, mathematics, computer science and the philosophy of mind. This original publication records the moment at which computation became an object of precise mathematical investigation.


Origins of Cyberspace, no. 394.

Previous
|
Next
10 
of  92
Privacy Policy
Manage cookies
Copyright © 2026 HS Rare Books
Site by Artlogic
Instagram, opens in a new tab.
Send an email

This website uses cookies
This site uses cookies to help make it more useful to you. Please contact us to find out more about our Cookie Policy.

Manage cookies
Reject non essential
Accept

Cookie preferences

Check the boxes for the cookie categories you allow our site to use

Cookie options
Required for the website to function and cannot be disabled.
Improve your experience on the website by storing choices you make about how it should function.
Allow us to collect anonymous usage data in order to improve the experience on our website.
Allow us to identify our visitors so that we can offer personalised, targeted marketing.
Save preferences
Close

Join our mailing list

Signup

* denotes required fields

We will process the personal data you have supplied to communicate with you in accordance with our Privacy Policy. You can unsubscribe or change your preferences at any time by clicking the link in our emails.