[FOM] Chaitin's Omega/P vs. NP

pax0 at seznam.cz pax0 at seznam.cz
Fri Apr 8 11:03:23 EDT 2011

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

More information about the FOM mailing list