Skip to main content
edited body
Source Link
Richard Stanley
  • 50.8k
  • 14
  • 155
  • 279

There is a 5-state, 2-sumbolsymbol Turing machine for which it is not known whether it halts. See http://en.wikipedia.org/wiki/Busy_beaver.

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.

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

Source Link
Richard Stanley
  • 50.8k
  • 14
  • 155
  • 279

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.