patternMinor
Whatever that can be done using algorithm can be done using Turing machine
Viewed 0 times
canalgorithmthatusingdonewhateverturingmachine
Problem
In 1937 how was Alan Turing so sure that all that can be done using algorithms can be implemented using a Turing machine?
Since that period many new algorithms were implemented. What was his hypothesis behind this theory ?
Since that period many new algorithms were implemented. What was his hypothesis behind this theory ?
Solution
The hypotesis is the following:
"Since an algorithm is a well-defined sequence of steps we can always execute an algorithm in a piece of paper(sometimes we may need a really big paper) using a pencil."
Then he created the Turing Machine who can simulate a hand using a pencil with an infinite paper.
"Since an algorithm is a well-defined sequence of steps we can always execute an algorithm in a piece of paper(sometimes we may need a really big paper) using a pencil."
Then he created the Turing Machine who can simulate a hand using a pencil with an infinite paper.
Context
StackExchange Computer Science Q#56454, answer score: 3
Revisions (0)
No revisions yet.