Write to the booksellers
SOLES BENOIT
MACHINE DE TURING -LA-
AVANT SCENE THEATRE EDITIONS
Reference : SLIVCN-9782749814247
LIVRE A L’ETAT DE NEUF. EXPEDIE SOUS 3 JOURS OUVRES. NUMERO DE SUIVI COMMUNIQUE AVANT ENVOI, EMBALLAGE RENFORCE. EAN:9782749814247
Bookseller's contact details
Bookit!
M. Alexandre Bachmann
Passage du Rond Point 4
1205 Genève
Switzerland
Payment mode
Sale conditions
Virement bancaire, PayPal, TWINT!
4 book(s) with the same title
MACHINE DE TURING -LA-
POINTS
LIVRE A L’ETAT DE NEUF. EXPEDIE SOUS 3 JOURS OUVRES. NUMERO DE SUIVI COMMUNIQUE AVANT ENVOI, EMBALLAGE RENFORCE. EAN:9782020369282
La machine de Turing - Collection Points Sciences n°131.
Seuil. 1999. In-12. Broché. Bon état, Couv. convenable, Dos satisfaisant, Intérieur frais. 174 pages.. . . . Classification Dewey : 510-Mathématiques
Collection Points Sciences n°131 - traduit de l'anglais par Julien Basch et Patrice Blanchard. Classification Dewey : 510-Mathématiques
La machine de Turing : texte intégral
Nathan Classique
LIVRE A L’ETAT DE NEUF. EXPEDIE SOUS 3 JOURS OUVRES. NUMERO DE SUIVI COMMUNIQUE AVANT ENVOI, EMBALLAGE RENFORCE. EAN:9782091878157
Finite Combinatory Processes-Formulation 1. [In: The Journal of Symbolic Logic, Vol. 1, Number 3, Sept. 1936]. - [A SIMULTANEOUS VERSION OF THE ""TURING MACHINE""]
[No place], 1936. 8vo. Extract, unbound, unstapled. Pp. 103-105.
The uncommon first printing of Post's seminal paper, in which he, simultaneously with but independently of Turing, describes a logic automaton, which very much resembles the Turing machine. The Universal Turing Machine, which is presented for the first time in Turing's seminal paper in the Proceedings of the London Mathematical Society for 1936 (same year as the present paper), is considered one of the most important innovations in the theory of computation and constitutes the most famous theoretical paper in the history of computing. ""Post [in the present paper] suggests a computation scheme by which a ""worker"" can solve all problems in symbolic logic by performing only machinelike ""primitive acts"". Remarkably, the instructions given to the ""worker"" in Post's paper and to a Universal Turing Machine were identical."" (A Computer Perspective, p. 125). ""The Polish-American mathematician Emil Post made notable contributions to the theory of recursive functions. In the 1930s, indepently of Turing, Post came up with the concept of a logic automaton similar to a Turing machine, which he described in the present paper [the paper offered]. Post's paper was intended to fill a conceptual gap in Alonzo Churchs' paper on ""An unsolvable problem of elementary number theory"" (Americ. Journ. of Math. 58, 1936). Church's paper had answered in the negative Hilbert's question as to whether a definite method existed for proving the truth or falsity of any mathematical statement (the Entscheidungsproblem), but failed to provide the assertion that any such definite method could be expressed as a formula in Church's lambda-calculus. Post proposed that a definite method would be written in the form of instructions to a mindless worker operating on an infinite line of ""boxes"" (equivalent to Turing's machine's ""tape""). The worker would be capable only of reading the instructions and performing the following tasks... This range of tasks corresponds exactly to those performed by a Turing machine, and Church, who edited the ""Journal of Symbolic Logic"", felt it necessary to insert an editorial note referring to Turing's ""shortly forthcoming"" paper on computable numbers, and ascertaining that ""the present article... although bearing a later date, was written entirely independently of Turing's"" (p. 103)."" (Origins of Cyberspace, pp. 111-12).Hook & Norman, Origins of Cyberspace, 2002: 355.Charles & Ray Eames, A Computer Perspective, 1973: 125.
