Mathematics – Logic
Scientific paper
2002-12-03
Mathematics
Logic
11 pages
Scientific paper
We discuss the question of Ralf-Dieter Schindler whether for infinite time
Turing machines P^f = NP^f can be true for any function f from the reals into
omega_1. We show that ``almost everywhere'' the answer is negative.
Hamkins Joel David
Welch Philip D.
No associations
LandOfFree
P^f is not equal to NP^f for almost all f 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^f is not equal to NP^f for almost all f, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P^f is not equal to NP^f for almost all f will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-496341