The Von Neumann model is too informal and too
complex to allow us to prove any properties about
what computation is and what computation can and cannot do.
We need a simple, formal, sufficiently powerful model for computation.
The standard model is the Turing machine.
Algorithms solve problems
An instance of a problem is represented as input in the form of a string of bits, or more generally, a string of symbols.
Some computation is performed according to an algorithm that results in attaining a solution for that instance.
The solution for that instance is represented as output also in the form of a string of symbols.
CS 4124: Theory of Computation
A Swedish View of Alan Turing
Other things that are attributed to Alan Turing:
Code Breaking During World War II
The Colossus "Computer"
The Turing test
CS1104 Main Page
Last Updated 01/05/2000
© L.Heath, 2000