Write to the booksellers
LASSEGUE, Jean - TURING, Alan
Turing.
Coll. "Figures du Savoir", Paris, éd. Les Belles Lettres, 2003, 2e tirage, in-8, cartonnage souple, couv. ill. coul. sur fond noir éd., 210 pp., bibliographie, table des matières, "Alan Turing (1912-1954), mathematicien et logicien, est considere comme le pere de l'informatique et de l'intelligence artificielle. Il etait aussi theoricien de la biologie et philosophe: lui revient le merite d'avoir mis en rapport la logique et la biologie. On essaye ici de retracer l'itineraire exceptionnel de ce savant qui fut aussi un homme d'action: pendant la seconde guerre mondiale, alors que les sous-marins allemands faisaient le blocus de l'Angleterre il decrypte les messages codes par la machine Enigma envoyes par radio de Berlin; malgre la penurie d'apres-guerre, il a concu le projet de l'ordinateur et l'a rendu operationnel; il avait, des 1945, le projet de "construire un cerveau"... Ce livre, presentant pour la premiere fois en francais l'ensemble de l'oeuvre de Turing, vise a mieux faire comprendre le monde de la techno-science dans lequel nous vivons aujourd'hui et que Turing a contribue a engendrer." Très bon état
Reference : 70353
Bookseller's contact details
Le Festin de Babette
M. Robert De Jonghe
3, rue de la Poêlerie
86500 Montmorillon
France
05 49 91 99 48
Payment mode
Sale conditions
Conformes aux usages de la Librairie ancienne, ainsi qu'aux ventes réalisées par correspondance.
5 book(s) with the same title
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.
A Method for the Calculation of the Zeta-Function. [Received 7 March, 1939. - Read 16 March, 1939]. [In: Proceedings of the London Mathematical Society. Second Series. Volume 48]. - [TURING'S FIRST WORK ON THE ZETA-FUNCTION]
London, Hodgson & Son, 1945. Royal 8vo. Entire volume 48 of ""Proceedings of the London Mathematical Society. Second Series"" bound WITH ALL THE SIX ORIGINAL FRONT-WRAPPERS for all six parts of the volume (bound in at rear) in a very nice contemporary blue full cloth binding with gilt lettering and gilt ex-libris (""Belford College. Univ. London"") to spine. Very minor bumping to extremities. Overall in excellent, very nice, clean, and fresh condition in- as well as ex-ternally. Small circle-stamp to pasted-down front free end-paper and to title-page (""Bedford College for Women""). Book-plate stating that the book was presented to the Library of Bedford College by ""Professor H. Simpson./ 1945"" + discreet library-markings to upper margin of pasted-down front free end-paper. Pp. 180-197. [Entire volume: (4),477, (1) pp + 1 plate (balance sheet)].
The very rare first printing of Turing's first published paper devoted to the Riemann-zeta function, the basis for his famous ""Zeta-function Machine"", a foundation for the digital computer.While working on his Ph.D.-thesis, Turing was concerned with a few other subjects as well, one of them seemingly having nothing to do with logic, namely that of analytic number theory. The problem that Turing here took up was that of the famous Riemann Hypothesis, more precisely the aspect of it that concerns the distribution of prime numbers. This is the problem that Hilbert in 1900 listed as one of the most important unsolved problems of mathematics. Turing began investigating the zeros of the Rieman zeta-function and certain of its consequences. The initial work on this was never published, though, but nevertheless he continued his work. ""Turing had ideas for the design of an ""analogue"" machine for calculating the zeros of the Riemann zeta-function, similar to the one used in Liverpool for calculating the tides."" (Herken, The Universal Turing Machine: A Half-Century Survey, p. 110). Having worked on the zeta-function since his Ph.D.-thesis but never having published anything directly on the topic, Turing began working as chief cryptanalyst during the Second World War and thus postponed this important work till after the war. Thus, it was not until 1945 that he was actually able to publish his first work on this most important subject, namely the work that he had presented already in 1939, the groundbreaking ""A Method for the Calculation of the Zeta-Function"", which constitutes his first printed contribution to the subject.""After the publication of his paper ""On computable Numbers,"" Turing had begun investigating the Riemann zeta-function calculation, an aspect of the Riemann hypothesis concerning the distribution of prime numbers... Turing's work on this problem was interrupted by World War II, but in 1950 he resumed his investigations with the aid of the Manchester University Mark I [one of the earliest general purpose digital computers]..."" (Origins of Cyberspace p. 468).Not in Origins of Cyberspace (on this subject only having his 1953-paper - No. 938).
A Method for the Calculation of the Zeta-Function. [Received 7 March, 1939. - Read 16 March, 1939]. [In: Proceedings of the London Mathematical Society. Second Series. Volume 48]. - [TURING'S FIRST WORK ON THE ZETA-FUNCTION]
London, Hodgson & Son, 1945. Royal 8vo. Entire volume 48 of ""Proceedings of the London Mathematical Society. Second Series"" bound in a nice contemporary blue full cloth binding with gilt ex-libris (""Sir John Cass College"") to front board and gilt title-label and year to spine. Very minor wear to extremities. Nicely re-enforced at inner hinges. A very nice, clean, and tight copy. Large library-book-plate to inside of front board (stating that the volume was presented by ""Dr. A.E.R. Church""), with ""withdrawn""-stamp. Also ""withdrawn""-stamp to title-page and to final page, and a library-stamp to p. (1). Otherwise a nice and clean copy with no markings, etc. Pp. 180-197. [Entire volume: (4),477, (1) pp.
The very rare first printing of Turing's first published paper devoted to the Riemann-zeta function, the basis for his famous ""Zeta-function Machine"", a foundation for the digital computer.While working on his Ph.D.-thesis, Turing was concerned with a few other subjects as well, one of them seemingly having nothing to do with logic, namely that of analytic number theory. The problem that Turing here took up was that of the famous Riemann Hypothesis, more precisely the aspect of it that concerns the distribution of prime numbers. This is the problem that Hilbert in 1900 listed as one of the most important unsolved problems of mathematics. Turing began investigating the zeros of the Rieman zeta-function and certain of its consequences. The initial work on this was never published, though, but nevertheless he continued his work. ""Turing had ideas for the design of an ""analogue"" machine for calculating the zeros of the Riemann zeta-function, similar to the one used in Liverpool for calculating the tides."" (Herken, The Universal Turing Machine: A Half-Century Survey, p. 110). Having worked on the zeta-function since his Ph.D.-thesis but never having published anything directly on the topic, Turing began working as chief cryptanalyst during the Second World War and thus postponed this important work till after the war. Thus, it was not until 1945 that he was actually able to publish his first work on this most important subject, namely the work that he had presented already in 1939, the groundbreaking ""A Method for the Calculation of the Zeta-Function"", which constitutes his first printed contribution to the subject.""After the publication of his paper ""On computable Numbers,"" Turing had begun investigating the Riemann zeta-function calculation, an aspect of the Riemann hypothesis concerning the distribution of prime numbers... Turing's work on this problem was interrupted by World War II, but in 1950 he resumed his investigations with the aid of the Manchester University Mark I [one of the earliest general purpose digital computers]..."" (Origins of Cyberspace p. 468).Not in Origins of Cyberspace (on this subject only having his 1953-paper - No. 938).
A Method for the Calculation of the Zeta-Function. [Received 7 March, 1939. - Read 16 March, 1939]. [In: Proceedings of the London Mathematical Society. Second Series. Volume 48]. - [TURING'S FIRST WORK ON THE ZETA-FUNCTION]
London, Hodgson & Son, 1945. Royal8vo. In a recent nice green full cloth binding with gilt lettering to spine. Entire volumes 48 of ""Proceedings of the London Mathematical Society. Second Series"". A very nice and clean copy without any institutional stamps. Pp. 180-197. [Entire volume: (4),477 pp.]
First printing of Turing's first published paper devoted to the Riemann-zeta function, the basis for his famous ""Zeta-function Machine"", a foundation for the digital computer.While working on his Ph.D.-thesis, Turing was concerned with a few other subjects as well, one of them seemingly having nothing to do with logic, namely that of analytic number theory. The problem that Turing here took up was that of the famous Riemann Hypothesis, more precisely the aspect of it that concerns the distribution of prime numbers. This is the problem that Hilbert in 1900 listed as one of the most important unsolved problems of mathematics. Turing began investigating the zeros of the Rieman zeta-function and certain of its consequences. The initial work on this was never published, though, but nevertheless he continued his work. ""Turing had ideas for the design of an ""analogue"" machine for calculating the zeros of the Riemann zeta-function, similar to the one used in Liverpool for calculating the tides."" (Herken, The Universal Turing Machine: A Half-Century Survey, p. 110). Having worked on the zeta-function since his Ph.D.-thesis but never having published anything directly on the topic, Turing began working as chief cryptanalyst during the Second World War and thus postponed this important work till after the war. Thus, it was not until 1945 that he was actually able to publish his first work on this most important subject, namely the work that he had presented already in 1939, the groundbreaking ""A Method for the Calculation of the Zeta-Function"", which constitutes his first printed contribution to the subject.""After the publication of his paper ""On computable Numbers,"" Turing had begun investigating the Riemann zeta-function calculation, an aspect of the Riemann hypothesis concerning the distribution of prime numbers... Turing's work on this problem was interrupted by World War II, but in 1950 he resumed his investigations with the aid of the Manchester University Mark I [one of the earliest general purpose digital computers]..."" (Origins of Cyberspace p. 468).Not in Origins of Cyberspace (on this subject only having his 1953-paper - No. 938).
Rounding-off Errors in Matrix Processes. - [TURING'S LU FACTORIZATION]
Oxford, Clarendon Press, 1948. 8vo. Bound in contemporary full calf with gilt lettering to spine. In ""The Quarterly Journal of Mechanics and Applied Mathematics"", Vol. 1, 1948. Previous owner's name written to front free-endpaper. Ver fine and clean. Pp. 287-380. [Entire volume: (4), 474 pp.].
First printing of this important paper in which Turing for the very first time introduced the concept of LU factorization or LU decomposition. ""Turing's paper was one of the earliest attempts to examine the error analysis of the various methods of solving linear equations and inverting matrices. His analysis was basically sound. The main importance of the paper was that it was published at the dawn of the modern computing era, and it gave indications of which methods were 'safe' when solving such problems on a computer"". (Burgoyne, Collected Works of A M Turing).""In 1945, [Turing] declined an offer of a Fellowship at King's [College, Cambridge] in favour of joining the newly formed Mathematical Division at the National Physical Laboratory (NPL). His early work on computability, combined with his wartime experience in electronics, had fired him with an enthusiasm for working on the design of an electronic computer. ethe machine he designed, which was called the Automatic Computing Engine (ACE) in recognition of Babbage's pioneering work, was characteristically original…""While in the Mathematics Division of NPL, Turing became keenly interested in numerical analysis. His paper, ""Rounding-off Errors in Matrix Processes"", showed that the acute anxiety about the effect of rounding errors in Gaussian elimination was largely unjustified. This paper has been overshadowed to some extent by the von Neumann and Goldstine paper on matrix inversion, but it is a brilliant piece of work and would have repaid closer study at the time"". (""Turing, Alan M."" by James H. Wilkinson, p. 1803, in Encyclopedia of Computer Science, A. Ralston et al (eds.), 4th edition, Nature Publishing Group, 2000).In linear algebra, LU decomposition factorizes a matrix as the product of a lower triangular matrix and an upper triangular matrix. LU decomposition is a key step in several fundamental numerical algorithms in linear algebra such as solving a system of linear equations, inverting a matrix, or computing the determinant of a matrix. Not in Origins of Cyberspace nor The Erwin Tomash Library.
