News for hackers. Stuff that matters.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by Scarblac on Friday May 04, 2018 @03:05AM (#16992735)
Of course. The number of Turing machines is countable, so you can number them. HALT(n) is 1 when Turing machine halts and 0 when it doesn't.

Incomputable but always 0 or 1.

Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by Firadeoclus on Friday May 04, 2018 @05:46AM (#16993323)
Except if you doubt that "when it doesn't halt" is an actual condition.