Turing's vision : the birth of computer science / Chris Bernhardt.

By:

Bernhardt, Chris [Author]

Material type: Text

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780262333801
9780262333818
9780262333795

Subject(s):

Genre/Form:

Electronic Books.

LOC classification:

QA29 .T875 2016

Online resources:

Click to access digital title | log in using your CIU ID number and my.ciu.edu password

Available additional physical forms:

Contents:

Some undecidable decision problems -- Finite automata -- Turing machines -- Other systems for computation -- Encodings and the universal machine -- Undecidable problems -- Cantor's diagonalization arguments -- Turing's legacy.

Subject: "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."--Jacket.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	URL	Status	Date due	Barcode
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD)	G. Allen Fleece Library ONLINE	Non-fiction	QA29.8 (Browse shelf(Opens below))	Link to resource	Available		ocn949930743

Includes bibliographies and index.

Background -- Some undecidable decision problems -- Finite automata -- Turing machines -- Other systems for computation -- Encodings and the universal machine -- Undecidable problems -- Cantor's diagonalization arguments -- Turing's legacy.

"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."--Jacket.

https://lib.ciu.edu/copyright-request-form

There are no comments on this title.

to post a comment.