Some variant definitions define it as the number of time steps taken by the machine instead. Wikipedia talks about their relationship, but no patience right now.

This problem is theoretically interesting because many important mathematical conjectures have been proved to be equivalent to whether a given Turing machine halts or not, this is notably the case for:

- Goldbach's conjecture: 27 states
- Riemann hypothesis: 744 states
- the consistency of Zermelo-Fraenkel set theory: 7910 states

Therefore, if we were able to compute $BB(n)$, we would be able to prove those conjectures automatically, by letting the machine run up to $BB(n)$, and if it hadn't halted by then, we would know that it would never halt.

Of course, in practice, $BB$ is generally uncomputable, so we will never know it. And furthermore, even if it were, it would take a lot longer than the age of the universe to compute any of it, so it would be useless.

However, philosophically speaking at least, the number of states of the equivalent Turing machine gives us a philosophical idea of the complexity of the problem.

- Function problem | 25, 517, 5
- Decision problem | 73, 599, 7
- Computational problem | 17, 1k, 22
- Computer science | 260, 3k, 72
- Computer | 138, 24k, 589
- Technology | 15, 39k, 911
- Ciro Santilli's Homepage | 262, 182k, 3k