On Computable Numbers, with an Application to the Entscheidungsproblem

lot/on computable numbers with an application to the entscheidungsproblem CEtKBSe 632677545 / Price history

lot/on computable numbers with an application to the entscheidungsproblem CEtKBSe 632677545

For saleAuction results

lot/on computable numbers with an application to the entscheidungsproblem CEtKBSe 632677545

For saleAuction results

Bring your auction to collectors worldwide!

Get listed now

On Computable Numbers, with an Application to the Entscheidungsproblem

TURING, Alan Mathison (1912-1954). "On computable numbers, with an application to the Entscheidungsproblem." In: Proceedings of the London Mathematical Society . 2nd series, vol. 42, pt. 3 (30 November 1936): 230-240; 2nd series, vol. 42, pt. 4 (23 December 1936): 241-265; and 2nd series, vol. 43, pt. 7 (30 December 1937), being the "Correction": 544-546. First edition of the foundation of theoretical computer science, introducing the concept of a "universal machine" for the first time and defining what it means for a function to be computable. In 1935 while at Cambridge, Turing attended M.H.A. Newman's course on the Foundations of Mathematics. While Kurt Gödel had demonstrated that arithmetic could not be proved consistent, and it was certainly not consistent and complete, the last of mathematics' fundamental problems as posed by David Hilbert remained: is mathematics decidable? In other words, was there a definite method which could be applied to any assertion which was guaranteed to produce a correct decision as to whether that assertion was true? Known by its German name Entscheidungsproblem , Newman posed the question as to whether a mechanical process could be applied to this. By the words "mechanical process," what Newman really meant was "definite method" or "rule"; but for Turing "mechanical" meant "machine." Turing imagined a machine set up with a table of behavior to add, multiply, divide, etc. If one assembled lots of different tables for lots of different calculations, and then ordered them by rank of complexity, starting with the simplest, then in theory it would be possible to produce a list of all computable numbers. However, no such list could possibly contain all the real numbers (i.e. all infinite decimals), and therefore the computable could give rise to the uncomputable. Thus Turing understood that no machine – or "definite method" / "mechanical process" – could ever solve all mathematical questions; and therefore the answer to the Entscheidungsproblem was that mathematics was undecidable. Unfortunately, Alonzo Church had fractionally pre-empted Turing by coming to the same conclusion on the Entscheidungsproblem . However, Church had used the very different approach of lambda calculus, and Newman realized the greatness of Turing's paper lay in his unique approach and conception of machines to attack mathematical problems. Thus, this paper also laid the foundations for modern digital computing. It was a brilliant amalgamation of pure mathematical logic and theory with a practical engineering component. The abstract machines described in "On computable numbers" would become the reality of Colossus and modern microprocessors. Origins of Cyberspace 394. Three parts, quarto (259 x 175mm). Original grayish-green printed wrappers (rebacked, front wrapper to part 1 with small marginal stain at head and repaired on verso, with 4 very short tears to fore-edge without loss repaired by tape on verso, 2 tiny nicks to front wrapper of part 2, tape repair to verso of top corner of front wrapper of part 3); cloth box.

Estimate:$30,000

Sold for:-