Please does someone know if we knew the well-known Chaitin's Omega
(the probability of halting a chosen universal Turing machine on a random input)
to enough bits, then we could settle the P vs. NP problem?
Thank you, Jan Pax