News for hackers. Stuff that matters.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by tialaramex on Wednesday May 09, 2018 @06:26AM (#17028752)
There's an error here - I said that computability isn't a property of numbers. That's not really fair. Real numbers on the whole can be non-computable, but all the Integers are computable, and all these BB() family functions have integer results, so those numbers would always be computable, we just have no idea what they are exactly.

Chaitin's Constants are not computable. They're some fraction (between 0 and 1) which is the probability of a randomly chosen program for some Turing equivalent system halting. This constant will vary depending on how the system works, but we can't compute it for any system at all for obvious reasons.

There are no comments on this comment yet.