P^f is not equal to NP^f for almost all f
Logic
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0212046,
title = {P^f is not equal to NP^f for almost all f},
author = {Joel David Hamkins and Philip D. Welch},
journal= {arXiv preprint arXiv:math/0212046},
year = {2007}
}
Comments
11 pages