Page "Chaitin's constant" Paragraph 36
from
Wikipedia
No halting probability is computable.
The proof of this fact relies on an algorithm which, given the first n digits of Ω, solves Turing's halting problem for programs of length up to n. Since the halting problem is undecidable, Ω can not be computed.
Page 1 of 1.
2.023 seconds.