Hacker News new | ask | show | jobs
by xamuel 3088 days ago
You're confused. Only very basic arithmetic is needed to prove that any particular TM halts (if it does halt). You might have meant to say something like, "can only prove that N of the Busy Beavers are really Busy Beavers".
1 comments

You're right. I should have written "halts last among its peers" or similar.