Page "Chaitin's constant" Paragraph 16

Because many outstanding problems in number theory, such as Goldbach's conjecture are equivalent to solving the halting problem for special programs ( which would basically search for counter-examples and halt if one is found ), knowing enough bits of Chaitin's constant would also imply knowing the answer to these problems.

But as the halting problem is not generally solvable, and therefore calculating any but the first few bits of Chaitin's constant is not possible, this just reduces hard problems to impossible ones, much like trying to build an oracle machine for the halting problem would be.