Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Turing's Vision : The Birth of Computer Science - Chris Bernhardt

Turing's Vision

The Birth of Computer Science

By: Chris Bernhardt

eText | 13 May 2016

At a Glance

eText

$28.99

or 4 interest-free payments of $7.25 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionComputing & I.T.Computer ScienceEngineering & TechnologyTechnology in GeneralHistory of Engineering & TechnologyInformation Technology General IssueBiographies & True Stories BiographiesScience, Technology & Medicine Biographies

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Amazon.com

Get Big Fast

eBook

$22.99

This is For Everyone - Tim Berners-Lee

eBOOK

This is For Everyone

eBook

$17.99

This product is categorised by