P^f is not equal to NP^f for almost all f
| dc.creator | Hamkins, Joel David | |
| dc.creator | Welch, Philip D. | |
| dc.date | 2002-12-03 | |
| dc.date.accessioned | 2026-07-07T04:53:30Z | |
| dc.date.available | 2026-07-07T04:53:30Z | |
| dc.description | 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. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/math/0212046 | |
| dc.identifier | http://arxiv.org/abs/math/0212046 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65874 | |
| dc.subject | Logic | |
| dc.subject | 03D30; 03D60; 03D15; 68Q15 | |
| dc.title | P^f is not equal to NP^f for almost all f | |
| dc.type | text |