Original Paper

Pf ≠ NPf for almost all f

  1. Joel David Hamkins1,2,*,
  2. Philip D. Welch3,4,†

Article first published online: 3 JUL 2003

DOI: 10.1002/malq.200310057

Issue

Mathematical Logic Quarterly

Mathematical Logic Quarterly

Volume 49, Issue 5, pages 536–540, September 2003

Additional Information

How to Cite

Hamkins, J. D. and Welch, P. D. (2003), Pf ≠ NPf for almost all f. Mathematical Logic Quarterly, 49: 536–540. doi: 10.1002/malq.200310057

Author Information

  1. 1

    Mathematics, Georgia State University, 30 Pryor Street, Atlanta, GA 30303, U. S. A.

  2. 2

    Mathematics, City University of New York, 365 Fifth Avenue, New York, NY 10016, U. S. A.

  3. 3

    Department of Mathematics, University of Bristol, Bristol BS8 1TW, England

  4. 4

    Mathematisches Institut, Beringstraße 6, 53115 Bonn, Germany

  1. †

    http://www.maths.bris.ac.uk/∼mapdw

*http://jdh.hamkins.org

Publication History

  1. Issue published online: 3 JUL 2003
  2. Article first published online: 3 JUL 2003
  3. Manuscript Accepted: 23 APR 2003
  4. Manuscript Revised: 22 APR 2003
  5. Manuscript Received: 15 OCT 2002

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (125K)

Keywords:

  • Infinite time Turing machine;
  • P = NP

Abstract

We discuss the question of Ralf-Dieter Schindler whether for infinite time Turing machines Pf = NPf can be true for any function f from the reals into ω1. We show that “almost everywhere” the answer is negative.

Get PDF (125K)