[FOM] inconsistency of P
nelson at math.Princeton.EDU
Sat Oct 1 08:36:43 EDT 2011
Terrence Tao, at
and independently Daniel Tausk (private communication)
have found an irreparable error in my outline.
In the Kritchman-Raz proof, there is a low complexity
proof of K(\bar\xi)>\ell if we assume \mu=1, but the
Chaitin machine may find a shorter proof of high
complexity, with no control over how high.
My thanks to Tao and Tausk for spotting this.
I withdraw my claim.
The consistency of P remains an open problem.
More information about the FOM