There is a 5-state, 2-sumbol 2-symbol Turing machine for which it is not known whether it halts. See http://en.wikipedia.org/wiki/Busy_beaver.
|
2 | edited body | ||
|
|
||||
|
1 |
|
||
|
There is a 5-state, 2-sumbol Turing machine for which it is not known whether it halts. See http://en.wikipedia.org/wiki/Busy_beaver. |
||||

