Show that the function B(n) cannot be computed by any
Chapter , Problem 32E(choose chapter or problem)
Problem 32E
Show that the function B(n) cannot be computed by any Turing machine. [Hint: Assume that there is a Turing machine that computes B(n) in binary. Build a Turing machine T that, starting with a blank tape, writes n down in binary, computes B(n) in binary, and converts B(n) from binary to unary. Show that for sufficiently large n, the number of states of T is less than B(n), leading to a contradiction.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer