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 |
10 years, 2 months ago by Ran G. |
|
viewed |
69 times |
|
active |
7 years, 10 months ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
Undecidability in optimal data compressionDisprove: if L is decidable then Prefix(L) is decidable
Proving Undecidability of this Language
Language of Turing machines that go through some configuration infinitely many times on empty input
Is the problem of "DFA-TM-INCLUSION" recursively enumerable?
more »