You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Limit, Logic, and Computation
Michael H. Freedman
Proceedings of the National Academy of Sciences of the United States of America
Vol. 95, No. 1 (Jan. 6, 1998), pp. 95-97
Published by: National Academy of Sciences
Stable URL: http://www.jstor.org/stable/44421
Page Count: 3
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We introduce ``ultrafilter limits'' into the classical Turing model of computation and develop a paradigm for interpreting the problem of distinguishing the class P from NP as a logical problem of decidability. We use P(NP) to denote decision problems which can be solved on a (nondeterministic) Turing machine in polynomial time. The concept is that in an appropriate limit it may be possible to prove that problems in P are still decidable, so a problem whose limit is undecidable would be established as lying outside of P.
Proceedings of the National Academy of Sciences of the United States of America © 1998 National Academy of Sciences