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 |
12 years, 6 months ago by Ran G. |
|
viewed |
73 times |
|
active |
10 years, 2 months ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
BPP, probabilistic-poly-time reductionIs the difference between an unrecognizable language and a finite language decidable? recognizable?
result of a union between a decidable language and not recognizable one - disjoint
Why does ISA includes instruction for logical operation?
Is UNIQUE(N) Turing-recognizable?
more »