Recursively Undecidable Properties of NP
arXiv:cs/0106049
Abstract
We show that there cannot be any algorithm that for a given nondeterministic polynomial-time Turing machine determinates whether or not the language recognized by this machine belongs to P
arXiv comment3 pages