2 ms·
Yes but this case requires Turing machines that produce very very large (BB large) outputs and then halt. Is that provable for a specific machine?
by andorov 10y ago
Yes but this case requires Turing machines that produce very very large (BB large) outputs and then halt. Is that provable for a specific machine?
- mafuy 10y agoAny specific machine can be proved to terminate or not terminate - albeit not always in ZFC. For instance, BB(10) can be computed, just as BB(10000) can, just that the latter cannot be computed in ZFC.