On the public citation graph

Pf ≠ NPf for almost all f

0 signed · 20 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.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1016/s0049-237x(08)71267-9openalex-snapshot
On Kleene Degrees of Analytic Sets
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1093/logcom/exi022openalex-snapshot
P ≠ NP ∩ co-NP for Infinite Time Turing Machines
inferredcites →https://doi.org/10.1112/s0024609399006657openalex-snapshot
The Length of Infinite Time Turing Machine Computations
inferredcites →https://doi.org/10.2307/2586556openalex-snapshot
Infinite time Turing machines
inferredcites →https://doi.org/10.2307/2586695openalex-snapshot
Eventually infinite time Turing machine degrees: infinite time decidable reals

What points at this work

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

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/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-03092-5_10openalex-snapshot
Is P = PSPACE for Infinite Time Turing Machines?
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.1093/logcom/exi022openalex-snapshot
P ≠ NP ∩ co-NP for Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.3390/math10060997openalex-snapshot
Computation and Hypercomputation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0307388openalex-snapshot
P is not equal to NP intersect coNP 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.