P ≠ NP ∩ co-NP for infinite time turing machines

15Citations
Citations of this article
142Readers
Mendeley users who have this article in their library.

Abstract

Extending results of Schindler, Hamkins and Welch, we establish in the context of infinite time Turing machines that P is properly contained in NP ∩ co-NP. For higher analogues of these classes, we exhibit positive and negative results.

Cite

CITATION STYLE

APA

Deolalikar, V., Hamkins, J. D., & Schindler, R. (2005). P ≠ NP ∩ co-NP for infinite time turing machines. Journal of Logic and Computation, 15(5), 579–592. https://doi.org/10.1093/logcom/exi022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free