A M Turing (21 results)

RUSTICA. Condition: Libro nuevo. *En este trabajo, A. M. Turing defiende la posibilidad de que las máquinas lleguen a pensar y polemiza con quienes objetan, desde diferentes perspectivas, tal posibilidad. Su lectura nos plantea indirectamente la cuestión del significado de "ser consciente". 50p.

17x12. 94p. Rústica ed. Con solapas. Buen estado. LIBRO EN ESPAÑOL.

Encuadernación de tapa blanda. Condition: Muy bien. 1ª Edición. Título Original: "Perspectives on the Computer Revolution" Traducción de Luis García Llorente. Colección: "Alianza Universidad" Núm. 119. MUY BUEN ejemplar. 700pp + 2h.

24,5 x 17 cm. Condition: Gut. 1. Auflage. XXII, 285 Seiten Innen sauberer, guter Zustand. Hardcover,Kunstledereinband, mit den üblichen Bibliotheks-Markierungen, Stempeln und Einträgen, innen wie außen, siehe Bilder. Kleiner Lederabrieb an der unteren Vorderdeckelkante. Rückendeckel mit zwei kleinen Blessuren oben. - Collected Works of A. M. Turing. B15-02-03D|A97 Sprache: Englisch Gewicht in Gramm: 780.…

Otros. Condition: New. Dust Jacket Condition: Nuevo. 01. En 1947 Alan M. Turing pronunció una conferencia ante un auditorio compuesto en su mayor parte por miembros del National Physical Laboratory de Londres en la que intentaba responder a la vieja y controvertida pregunta Puede pensar una máquina? . . . . . . Lo expuesto en ese acto apareció publicado tres años más tarde en Mind ?una importante revista de filosofía británica? y es lo que ofrecemos aquí al lector en su traducción castellana. Este texto se convirtió enseguida en uno de los escritos fundacionales de la lógica informática y la inteligencia artificial, al presentar las líneas generales por las que debería discurrir una respuesta precisa y manejable (aunque no indiscutible) a la pregunta formulada. . . . . . . Se trata del famoso Test de Turing, una prueba para decidir si una máquina es inteligente (o ?piensa?). Para ello Turing diseñó un juego de imitación en el que participan una máquina y seres humanos; podemos decir que una máquina piensa si un ser humano que se comunica con la máquina y con otros seres humanos no logra distinguir cuando su interlocutor es una máquina y cuando un humano. . . Una ?máquina de Turing? como la que participa en el juego, es un dispositivo ideal de cálculo, capaz de resolver una función computable ?una función cuya solución es susceptible de ser obtenida por un procedimiento mecánico? . . . . . . . Pero lo más significativo es que Turing demostró que hay una máquina peculiar ?la máquina universal de Turing? en la que se puede representar cualquier máquina que sea capaz de computar una función particular. De acuerdo con esto, una máquina universal de Turing sería una especie de sistema operativo en el que se implementan diferentes programas (máquinas de Turing especiales), un poco a la manera en que nos es familiar en los ordenadores personales. La denominada ?metáfora del ordenador? como modelo capaz de simular la mente humana y, por ende, el pensar, tiene aquí su fuente. LIBRO. …

Broschiert. Condition: Befriedigend. 297 S. Mit leichtem Nikotingeruch. Einband lichtrandig, leicht bestoßen und berieben. Papier altersgemäß leicht gebräunt. Kopfschnitt leicht fleckig. Sprache: Italienisch Gewicht in Gramm: 308.

Hardcover. Condition: Near Fine. No Jacket. This is the original edition of the famous PH.D. thesis of Princeton Univercity written 1938 - pgs 161 - 228 - 26,7 x 17,8 cm - total number of pgs of the volume:(4)+475 - original full cloth with title, vol., series and year printed in gold on the back -condition: the back is damaged on the tail side, a ticked has been removed (picture) and the right corner on the tail side is damaged (picture) , the inside is clean, no annotations or underlinig - the are 3 tears, one of them in the pg 181-182 of the article, the others pgs 231-232 and 235-236 but not affecting the text (pictures) - on the tittlepage a stamp Y486, probably the place to store the book in a library.…

1975 695pp Fotografías b/n Colecc. Alianza Universidad nº119 Selección y comentarios de Zenon W. Pylyshyn 8ºM(20x13) Rústica Buen estado levemente deslucido .

Hardcover. Condition: Fine. Dust Jacket Condition: Near Fine. (TURING, A.M.) A.M. Turing's ACE Report of 1946 and other Paper. MIT/Tomash, 1986. Part of the Reprint Series in the History of Computing from the Charles Babbage Institute. (6), 140pp. Cloth boards, dustjacket. Save for some small discoloration at the inside joints, and some discoloration to the dj, this would be a FINE copy. As it is the book is very crisp and the cloth binding is in excellent condition. Edited by B.E. Carpenter and R.W. Doran. 714.3.…

Hardcover. Condition: Very Good. (Alan M. Turing) COHEN, A. M. and M. J. E. Mayhew. In Proceedings of the London Mathematical Society, Third Series, Volume XVIII, 1968, pp. 691-713. Oxford: Oxford University Press, 1968. Offered is the entire hardback Very Good++ Ex-library vol XVIII with library bookplate front paste-down, library stamp title page and last page, no other library markings. Mild soil edges. 8vo. 768 pp. Hardcover. Very Good++. The authors begin the paper: "This paper is based on ideas of A. M. Turing as recorded in an unpublished, and in places inaccurate, manuscript. We reproduce part of Turing's introduction and, in substance, his first few lemmas, but diverge from his work in Lemma 6". This paper is included in the Collected Works of Alan Turing since it is completion of work he began (See Hodges 'Alan Turing Bibliography').…

Oxford 1968 Offered is the entire hardback Very Good++ Ex-library vol XVIII with library bookplate front paste-down, library stamp title page and last page, no other library markings. Mild soil edges. 8vo. 768 pp. Very Good++ Hardcover The authors begin the paper: "This paper is based on ideas of A. M. Turing as recorded in an unpublished, and in places inaccurate, manuscript. We reproduce part of Turing's introduction and, in substance, his first few lemmas, but diverge from his work in Lemma 6". This paper is included in the Collected Works of Alan Turing since it is completion of work he began (See Hodges 'Alan Turing Bibliography'). Mathematics. Book. …

Soft cover. Condition: Very Good. No Jacket. Entire volume offered. 137 pp; illus. Original printed wrappers. Very Good+. 'His last publication was in Penguin Science News, written like a modern Scientific American article, and entitled Solvable and unsolvable problems. Written vividly but from the perspective of a pure mathematician, its final words concerned the interpretation of unsolvable problems, such as the halting problem for Turing machines' (Andrew Hodges, 'Alan Turing: one of The Great Philosophers'; on Alan Turing Home Page).…

Paperback. Condition: Used: Very Good.

Soft cover. Condition: Very Good. . In :The Journal of the London Mathematical Society. Vol. 10. Part 1. January, 1935. No. 37. pp. 284-285. London: C. F. Hodgson, 1935. Offered is the entire hardback Very Good++ Ex-library volumes 9-10, 1934-1935 (bound in one book) with mild soil edges. Library bookplate front paste down. Library stamps title page, last page. No other library markings. 8vo. 320 pp. + 320 pp. Hardcover. Very Good++.This is Turing's earliest published paper. it is preceded only by his thesis, 'On the Gaussian Error Function' (1935) which was never published. Only the preface of the thesis is reproduced in the 'Collected Works' (See Hodges-Alan Turing Bibliography). //// DW ////Ask for pictures.…

Hardcover. Condition: Very Good. . In Proceedings of the London Mathematical Society. Third Series, Volume III (1953), pp. 99-117. Oxford: Clarendon Press, 1953. Offered is the Very Good++ complete volume III in blue buckram binding with scuffed leather spine label, gilt lettering. Deaccessioned from the John Cass College library with library bookplate front paste down, "withdrawn" stamp title page, last page. No other library markings. 8vo. 512 pp. Hardcover. Very Good++.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. (In 1900 Hilbert listed proving or disproving this hypothesis as one of the most important unsolved problems confronting mathematics; when this bibliography was written, the hypothesis remained unproven.) 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. (Mind, Chapter 5, p. 468). This paper describes the first use of a digital computer to calculate the zeros of the Reimann Zeta Function. The Zeta Function is of great significance in number theory because of its relation to the distribution of prime numbers. It also has applications in other areas such as physics, probability theory, and applied statistics (Hook & Norman Origins of Cyberspace #938). . //// DW ////Ask for pictures. //// DW ////Ask for pictures.…

(No place), The Association for Symbolic Logic, 1942, 1943 &1948. Lev8vo. Bound in two uniform red half cloth with gilt lettering to spine. In "Journal of Symbolic Logic", Volume 7, 8 [Bound together] & 13. Barcode label pasted on to back board. Small library stamp to lower part of 6 pages. Minor scratches to extremities of volume 13. A fine set. Pp. 28-33" Pp. 80-94. [Entire volumes: IV, 164 pp." IV, 236 pp.). First printing of the two important - but often overlooked - papers by Turing which provide "information about Turing's thoughts on the logical foundations of mathematics which is not to be found elsewhere in his writings". (Copeland, The Essential Turing, P. 206).…

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). …

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.…

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).…

1937. 8vo. Bound in recent marbled boards. Title-page for volume 2 of Journal of Symbolic Logic withbound. First edition of Turing's important paper, in which he links Kleene's recursive functions, Church's lambda-definable functions and his own computable functions and proves them to be identical. In the appendix of his milestone-paper "On Computable Numbers" from 1936, Turing gave a short outline of a method for proving that his notion of computability is equivalent with Alonzo Church's notion of lambda-definabilty. It was not until the present article, however, that it was proved that Steven Kleene's general recursive functions, Church's lambda-definable functions and Turing's computable functions were all identical. Kleene had already proved that every general recursive function is lambda-definable, so by showing that computability follows from lambda-definability and that general recursiveness follows from computability, Turing had ended the circle, which was a primary reason for its acceptance as a notion of "effective calculable" demanded by Hilbert's Entscheidungsproblem."The purpose of the present paper is to show that the computable functions introduced by the author (in "On computable numbers") are identical with the lambda-definable functions of Church and the general recursive functions due to Herbrand and Gödel and developed by Kleene." Turing wrote this paper while at Princeton studying with Church."(Hook and Norman No. 395). …

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).…