|
|
|
|
|
|
by Scarblac
357 days ago
|
|
|
There is a finite number of Turing machines of size 748. The number of them that eventually halt is thus also finite, and BB(748) is the highest number of steps in the finite list of how many steps each took to halt. It has to be a number. We just can't prove which number it is, we don't know which of the machines halt. |
|
|