3 ms·
Reminds me of Chaitin's constant: > In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number)[1] or halting
by carapace 9y ago
Reminds me of Chaitin's constant:
> In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number)[1] or halting probability is a real number that, informally speaking, represents the probability that a randomly constructed program will halt.
> Each halting probability is a normal and transcendental real number that is not computable, which means that there is no algorithm to compute its digits. Indeed, each halting probability is Martin-Löf random, meaning there is not even any algorithm which can reliably guess its digits.
~ https://en.wikipedia.org/wiki/Chaitin%27s_constant https://en.wikipedia.org/wiki/Chaitin%27s_constant