Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Chris Bernhardt is Professor of Mathematics at Fairfield University and the author of Turing's Vision: The Birth of Computer Science (MIT Press).
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Turing's Vision: The Birth of Computer Science...
Stock Image
Turing's Vision: The Birth of Computer Science (Mit Press)
Seller: One Planet Books, Columbia, MO, U.S.A.
Seller rating 4 out of 5 stars
paperback. Condition: Good. Reprint. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing and/or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 002270248U
Stock Image
Turing's Vision: The Birth of Computer Science (Mit Press)
Seller: GCCebooks, Salinas, CA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. Seller Inventory # 3UAP3I00293E
Stock Image
Turing's Vision: The Birth of Computer Science
Seller: Magers and Quinn Booksellers, Minneapolis, MN, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages. Seller Inventory # 1320493
Stock Image
Turing's Vision: The Birth of Computer Science (Mit Press)
Seller: HPB-Diamond, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_476719413
Stock Image
Turing's Vision: The Birth of Computer Science
Published by
MIT Press April 2017, 2017
ISBN 10: 0262533510
ISBN 13: 9780262533515
Used
Trade Paperback
Seller: Open Books West Loop, Chicago, IL, U.S.A.
Seller rating 4 out of 5 stars
Trade Paperback. Condition: Used. Seller Inventory # 1211869
Stock Image
Turing's Vision: The Birth of Computer Science (The MIT Press)
Seller: Textbooks_Source, Columbia, MO, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. Reprint. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 002270248U
Seller Image
Turing's Vision : The Birth of Computer Science
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Seller Inventory # 27727491-5
Seller Image
Turing's Vision : The Birth of Computer Science
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 27727491-n
Seller Image
Turing's Vision
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # LU-9780262533515
Stock Image
Turing's Vision (Paperback)
Published by
MIT Press Ltd, Cambridge, Mass., 2017
ISBN 10: 0262533510
ISBN 13: 9780262533515
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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.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 phonesIn 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. Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780262533515