Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
The classic paper that started it all.
On Computable Numbers, with an application to the Entscheidungsproblem
About
Stats
|
created |
11 years, 6 months ago by Ran G. |
|
viewed |
70 times |
|
active |
9 years, 2 months ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
Compiler that compiles to a Turing machine?Are there situations where we can decrease the time complexity of a program by increasing its ordinal complexity?
Why there can't be two instances of a "reverse" program in the Halting problem?
Show that the language is undecidable
Show that the language is undecidable
more »