An accessible and fascinating exploration of how Alan Turing’s mathematical theory gave rise to modern computer science and applications—from the desktops to cell phones
In 1936, when he was just 24 years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing’s Vision, Chris Bernhardt explains the theory for the general reader, beginning with its foundations and systematically building to its surprising conclusions. He also views Turing’s theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing’s later work, and the birth of the modern computer.
Turing wanted to show that there were problems that were beyond any computer’s ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing’s ideas, Bernhardt examines 3 well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing’s problem concerning computable numbers.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Chris Bernhardt is Professor of Mathematics at Fairfield University and the author of Turing's Vision: The Birth of Computer Science (MIT Press).
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 9,37 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 2,31 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : BooksRun, Philadelphia, PA, Etats-Unis
Paperback. Etat : Very Good. Reprint. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. N° de réf. du vendeur 0262533510-8-1
Quantité disponible : 1 disponible(s)
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Paperback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR008733392
Quantité disponible : 2 disponible(s)
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Paperback. Etat : New. Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader.In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers. N° de réf. du vendeur LU-9780262533515
Quantité disponible : Plus de 20 disponibles
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
Paperback. Etat : New. Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader.In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers. N° de réf. du vendeur LU-9780262533515
Quantité disponible : Plus de 20 disponibles
Vendeur : Rarewaves USA United, OSWEGO, IL, Etats-Unis
Paperback. Etat : New. Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader.In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers. N° de réf. du vendeur LU-9780262533515
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FV-9780262533515
Quantité disponible : 10 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Num Pages: 208 pages, 15 b&w illus. BIC Classification: UB; UY. Category: (G) General (US: Trade). Dimension: 203 x 136 x 14. . . 2017. Reprint. Paperback. . . . . N° de réf. du vendeur V9780262533515
Quantité disponible : 15 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days. 380. N° de réf. du vendeur B9780262533515
Quantité disponible : Plus de 20 disponibles
Vendeur : Magers and Quinn Booksellers, Minneapolis, MN, Etats-Unis
paperback. Etat : Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages. N° de réf. du vendeur 1320493
Quantité disponible : 3 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780262533515_new
Quantité disponible : 2 disponible(s)