Recursively Undecidable Properties of NP

Details Recursively Undecidable Properties of NP Recursively Undecidable Properties of NP

2001-06-25

arxiv.org/abs/cs/0106049v2

Computer Science

Computational Complexity

3 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Recursively Undecidable Properties of NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recursively Undecidable Properties of NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursively Undecidable Properties of NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193994