Re:Google reveals secret test of AI bot to beat top Go players
by andorov on Friday January 06, 2017 @10:01AM
(#13336709)
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?
[ Parent
| on HN ]
Re:Google reveals secret test of AI bot to beat top Go players
by mafuy on Wednesday January 18, 2017 @05:33AM
(#13425379)
Any 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.