On the public citation graph

P ≠ NP ∩ co-NP for Infinite Time Turing Machines

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.200310057openalex-snapshot
Pf ≠ NPf for almost all f
inferredcites →https://doi.org/10.1007/978-1-4612-4190-4openalex-snapshot
Classical Descriptive Set Theory
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/s00605-002-0545-5openalex-snapshot
P?NP for Infinite Time Turing Machines
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7055-7openalex-snapshot
Descriptive Set Theory
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.2307/2586556openalex-snapshot
Infinite time Turing machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200310057openalex-snapshot
Pf ≠ NPf for almost all f
inferred← citeshttps://doi.org/10.1007/11494645_22openalex-snapshot
Infinitary Computability with Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/11494645_65openalex-snapshot
The Transfinite Action of 1 Tape Turing Machines
inferred← citeshttps://doi.org/10.1007/11780342_34openalex-snapshot
Space Bounds for Infinitary Computation
inferred← citeshttps://doi.org/10.1007/11780342_58openalex-snapshot
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_20openalex-snapshot
Infinite Time Computable Model Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_6openalex-snapshot
Symmetry for Transfinite Computability
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_19openalex-snapshot
Koepke Machines and Satisfiability for Infinitary Propositional Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_12openalex-snapshot
Some Observations on Infinitary Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_5openalex-snapshot
A Survey of Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_14openalex-snapshot
Infinite-Time Turing Machines and Borel Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_10openalex-snapshot
Is P = PSPACE for Infinite Time Turing Machines?
inferred← citeshttps://doi.org/10.1007/978-981-19-9858-4_21openalex-snapshot
Turing Machines Behind the Horizon: Modeling Black Hole Interiors as Transfinite Limited Turing Machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.12.014openalex-snapshot
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.050openalex-snapshot
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.015openalex-snapshot
Transfinite machine models
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.004openalex-snapshot
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
inferred← citeshttps://doi.org/10.1017/jsl.2015.26openalex-snapshot
SAFE RECURSIVE SET FUNCTIONS
inferred← citeshttps://doi.org/10.1093/logcom/exaa025openalex-snapshot
Space and time complexity for infinite time Turing machines
inferred← citeshttps://doi.org/10.1109/csci62032.2023.00073openalex-snapshot
Understanding the Computational Complexity of Diverse Classes of Turing and Super-Turing Computational Models
inferred← citeshttps://doi.org/10.3233/com-230439openalex-snapshot
Lower bounds on β ( α ) and other properties of α-register machines
inferred← citeshttps://doi.org/10.3390/math10060997openalex-snapshot
Computation and Hypercomputation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0212046openalex-snapshot
P^f is not equal to NP^f for almost all f
inferred← citeshttps://doi.org/10.48550/arxiv.math/0305445openalex-snapshot
On the questions P ?= NP $\cap$ co-NP and NP ?= co-NP for infinite time Turing machines
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.