On the public citation graph

Space Bounds for Infinitary Computation

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/1521-3870(200105)47:2<271::aid-malq271>3.0.co;2-6openalex-snapshot
Infinite Time Turing Machines With Only One Tape
inferredcites →https://doi.org/10.1002/malq.200310057openalex-snapshot
Pf ≠ NPf for almost all f
inferredcites →https://doi.org/10.1007/11494645_1openalex-snapshot
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It
inferredcites →https://doi.org/10.1007/11494645_22openalex-snapshot
Infinitary Computability with Infinite Time Turing Machines
inferredcites →https://doi.org/10.1007/11494645_28openalex-snapshot
Computing a Model of Set Theory
inferredcites →https://doi.org/10.1007/11494645_65openalex-snapshot
The Transfinite Action of 1 Tape Turing Machines
inferredcites →https://doi.org/10.1007/11780342_58openalex-snapshot
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
inferredcites →https://doi.org/10.1007/978-0-387-68546-5openalex-snapshot
New Computational Paradigms: Changing Conceptions of What is Computable
inferredcites →https://doi.org/10.1007/978-1-4020-2776-5openalex-snapshot
Classical and new paradigms of computation and their complexity hierarchies : papers of the conference "foundations of the formal sciences III"
inferredcites →https://doi.org/10.1007/978-1-4020-2776-5_8openalex-snapshot
Supertask computation
inferredcites →https://doi.org/10.1007/s001530100112openalex-snapshot
Post's problem for supertasks has both positive and negative solutions
inferredcites →https://doi.org/10.1007/s00605-002-0545-5openalex-snapshot
P?NP for Infinite Time Turing Machines
inferredcites →https://doi.org/10.1017/s0960129506005615openalex-snapshot
Ordinal computations
inferredcites →https://doi.org/10.1023/a:1021180801870openalex-snapshot
Infinite Time Turing Machines
inferredcites →https://doi.org/10.1093/logcom/exi022openalex-snapshot
P ≠ NP ∩ co-NP for Infinite Time Turing Machines
inferredcites →https://doi.org/10.1093/logcom/exm031openalex-snapshot
Logical Approaches to Computational Barriers: CiE 2006
inferredcites →https://doi.org/10.1112/s0024609399006657openalex-snapshot
The Length of Infinite Time Turing Machine Computations
inferredcites →https://doi.org/10.2178/bsl/1122038993openalex-snapshot
Turing Computations On Ordinals
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
inferredcites →https://doi.org/10.48550/arxiv.math/0307388openalex-snapshot
P is not equal to NP intersect coNP for 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.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-642-03092-5_10openalex-snapshot
Is P = PSPACE for Infinite Time Turing Machines?
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.016openalex-snapshot
The computational strengths of α-tape 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/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-200327openalex-snapshot
Space-bounded OTMs and REG∞
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.