Dude, you have no idea what you're talking about. So please stop with the bullshit about great mathematicians and computer scientists when this has nothing to do with them -- only with you -- you cannot accept being wrong. Do your homework first.
Recognizable is not the same thing as acceptable. For example, some undecidable languages are recognizable by Turing machines.
You can leave it as an exercise for anyone you wish, but your assertion (existance of a simple metaproof that there is [a proof of either P=NP or P!=NP]) is false. I base my assertion about your assertion on the fact that about 40 years of research has not produced such a metaproof.
Recognizable is not the same thing as acceptable. For example, some undecidable languages are recognizable by Turing machines.
You can leave it as an exercise for anyone you wish, but your assertion (existance of a simple metaproof that there is [a proof of either P=NP or P!=NP]) is false. I base my assertion about your assertion on the fact that about 40 years of research has not produced such a metaproof.
reply