Recursively Undecidable Properties of NP
Computational Complexity
2011-11-09 v2
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
Cite
@article{arxiv.cs/0106049,
title = {Recursively Undecidable Properties of NP},
author = {V. G. Naidenko},
journal= {arXiv preprint arXiv:cs/0106049},
year = {2011}
}
Comments
3 pages