On the public citation graph
Eventually infinite time Turing machine degrees: infinite time decidable reals
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-387-49970-3_4openalex-snapshot
Infinite-Time TuringMachines
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0419235-7openalex-snapshot
The Theory of Countable Analytical Sets
inferredcites →https://doi.org/10.1112/s0024609399006657openalex-snapshot
The Length of Infinite Time Turing Machine Computations
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_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-030-14799-0_60openalex-snapshot
Approximate Outputs of Accelerated Turing Machines Closest to Their Halting Point
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_16openalex-snapshot
An algorithmic approach to characterizations of admissibles
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_7openalex-snapshot
Higher Type Recursion for Transfinite Machine Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_6openalex-snapshot
Discrete Transfinite Computation
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-03745-0_11openalex-snapshot
Relativistic Computers and Transfinite Computation
inferred← citeshttps://doi.org/10.1007/s00153-009-0146-2openalex-snapshot
Infinite time extensions of Kleene’s $${\mathcal{O}}$$
inferred← citeshttps://doi.org/10.1007/s10992-018-9478-xopenalex-snapshot
Guest Editors’ Introduction
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103741openalex-snapshot
Toward higher-order infinite time Turing machines: simulational $\Gamma$-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/s1755020308080118openalex-snapshot
ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH
inferred← citeshttps://doi.org/10.1023/a:1011946004905openalex-snapshot
Set-Theoretic Absoluteness and the Revision Theory of Truth
inferred← citeshttps://doi.org/10.1023/a:1021180801870openalex-snapshot
Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1090/s0002-9939-08-09275-7openalex-snapshot
Parameter-free uniformisation
inferred← citeshttps://doi.org/10.1093/bjps/55.4.739openalex-snapshot
On the Possibility, or Otherwise, of Hypercomputation
inferred← citeshttps://doi.org/10.1093/logcom/11.1.25openalex-snapshot
Revision Sequences and Computers with an Infinite Amount of Time
inferred← citeshttps://doi.org/10.1109/lics.2015.55openalex-snapshot
Feedback Turing Computability, and Turing Computability as Feedback
inferred← citeshttps://doi.org/10.1145/1778765.1778863openalex-snapshot
Parametric reshaping of human bodies in images
inferred← citeshttps://doi.org/10.1215/00294527-1306199openalex-snapshot
Infinite Time Decidable Equivalence Relation Theory
inferred← citeshttps://doi.org/10.1215/00294527-2022-0012openalex-snapshot
Decision Times of Infinite Computations
inferred← citeshttps://doi.org/10.1215/00294527-3832619openalex-snapshot
Infinite Computations with Random Oracles
inferred← citeshttps://doi.org/10.2178/jsl/1305810756openalex-snapshot
Weak systems of determinacy and arithmetical quasi-inductive definitions
inferred← citeshttps://doi.org/10.2307/2687753openalex-snapshot
On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set
inferred← citeshttps://doi.org/10.3233/com-160061openalex-snapshot
Infinite time recognizability from generic oracles and the recognizable jump operator
inferred← citeshttps://doi.org/10.3233/com-200301openalex-snapshot
Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
inferred← citeshttps://doi.org/10.3233/com-230439openalex-snapshot
Lower bounds on β ( α ) and other properties of α-register machines
inferred← citeshttps://doi.org/10.48550/arxiv.1012.1221openalex-snapshot
Infinite Time Cellular Automata: A Real Computation Model
inferred← citeshttps://doi.org/10.48550/arxiv.1510.00691openalex-snapshot
Well-founded Iterations of Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.70675/2f4d7cf2zf7d3z4d7azbdc6z85ef4e6bdca8openalex-snapshot
Toward higher-order and many-symbol 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.