3 ms·
Ooh, are they basically the number of possible turing programs encodable in a state of N?
by ijustlovemath 3y ago
Ooh, are they basically the number of possible turing programs encodable in a state of N?
- readams 3y agoIt's the maximum amount of time a Turing machine of size N can run. So if you want to know whether a Turning machine of size N or less will halt, just run it for BB(N) steps. If it hasn't halted by then, it never will.