|
|
|
|
|
|
by javajosh
1858 days ago
|
|
|
Let the proof of P != NP be A, where A is a proof expressible as a finite bitfield. The proof requires induction over an infinite sequence of proofs. But there is no mechanical way to move from the nth to the "n+1"th proof. Plus, "Galois", Gödel, Reimann and other intimidating names. QED. |
|
|