.jpg?w=1)
.jpg?w=1)
.jpg?w=1)
'On Computable Numbers, with an Application to the Entscheidungsproblem', in: Proceedings of the London Mathematical Society, series 2, vol. 42, pt. 3, pp. 230-40 and pt. 4, pp. 241-65. London: C.F. Hodgson & Son, Ltd. for The London Mathematical Society, 30 November 1936-23 December 1936.
细节
TURING, Alan Mathison (1912-1954)
'On Computable Numbers, with an Application to the Entscheidungsproblem', in: Proceedings of the London Mathematical Society, series 2, vol. 42, pt. 3, pp. 230-40 and pt. 4, pp. 241-65. London: C.F. Hodgson & Son, Ltd. for The London Mathematical Society, 30 November 1936-23 December 1936.
First edition of the foundation of modern digital computing, introducing the concept of a 'universal machine' for the first time; a fine set in the rarely-found original wrappers, completely unrestored. 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 Turning 'mechanical' meant 'machine'.
Turing imagined a machine set up with a table of behaviour 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. 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. A Correction was published one year later in order to remove some formal errors made in the first paper pointed out by the Swiss mathematician Paul Bernays (not included in this lot). Origins of Cyberspace 394.
2 issues, quarto (260 x 174mm). Original green-grey printed wrappers (first issue with spine stilted, spines lightly browned and with tiny losses at head and foot, a few light spots to fore-edge of first issue, second issue with faint crease to lower corner); housed in a modern clamshell box.
'On Computable Numbers, with an Application to the Entscheidungsproblem', in: Proceedings of the London Mathematical Society, series 2, vol. 42, pt. 3, pp. 230-40 and pt. 4, pp. 241-65. London: C.F. Hodgson & Son, Ltd. for The London Mathematical Society, 30 November 1936-23 December 1936.
First edition of the foundation of modern digital computing, introducing the concept of a 'universal machine' for the first time; a fine set in the rarely-found original wrappers, completely unrestored. 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 Turning 'mechanical' meant 'machine'.
Turing imagined a machine set up with a table of behaviour 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. 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. A Correction was published one year later in order to remove some formal errors made in the first paper pointed out by the Swiss mathematician Paul Bernays (not included in this lot). Origins of Cyberspace 394.
2 issues, quarto (260 x 174mm). Original green-grey printed wrappers (first issue with spine stilted, spines lightly browned and with tiny losses at head and foot, a few light spots to fore-edge of first issue, second issue with faint crease to lower corner); housed in a modern clamshell box.
注意事项
No VAT on hammer price or buyer's premium.
荣誉呈献
Julian Wilson
Senior Specialist, Books, Maps & Manuscripts