P not= NP for infinite time Turing machines

Details P not= NP for infinite time Turing machines P not= NP for infinite time Turing machines

2001-06-11

arxiv.org/abs/math/0106087v1

Mathematics

Logic

2 pages

Scientific paper

We state a version of the P=?NP problem for infinite time Turing machines. It
is observed that P not= NP for this version.

Affiliated with

Also associated with

No associations

Rating

P not= NP for infinite time Turing machines 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 P not= NP for infinite time Turing machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P not= NP for infinite time Turing machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560758