On the public citation graph

Infinite Time Register Machines

0 signed · 33 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/11494645_28openalex-snapshot
Computing a Model of Set Theory
inferredcites →https://doi.org/10.1007/11780342_27openalex-snapshot
Infinite Time Register 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.1017/9781316717301openalex-snapshot
Higher Recursion Theory
inferredcites →https://doi.org/10.1017/s0960129506005615openalex-snapshot
Ordinal computations
inferredcites →https://doi.org/10.1093/logcom/exm031openalex-snapshot
Logical Approaches to Computational Barriers: CiE 2006
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/421099openalex-snapshot
An Elementary Approach to the Fine Structure of L

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-030-80049-9_7openalex-snapshot
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_7openalex-snapshot
All Melodies Are Lost – Recognizability for Weak and Strong $$\alpha $$-Register Machines
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-319-94418-0_13openalex-snapshot
Taming Koepke’s Zoo
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_34openalex-snapshot
An Enhanced Theory of Infinite Time Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_82openalex-snapshot
Turing Unbound: Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_29openalex-snapshot
Ordinal Computability
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_41openalex-snapshot
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/s00153-009-0167-xopenalex-snapshot
The basic theory of infinite time register machines
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50002-2openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.010openalex-snapshot
The distribution of ITRM-recognizable reals
inferred← citeshttps://doi.org/10.1016/j.apal.2017.12.007openalex-snapshot
Recognizable sets and Woodin cardinals: computation beyond the constructible universe
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103041openalex-snapshot
Taming Koepke's Zoo II: Register machines
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.1017/cbo9781107338579.015openalex-snapshot
Transfinite machine models
inferred← citeshttps://doi.org/10.1017/jsl.2018.3openalex-snapshot
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
inferred← citeshttps://doi.org/10.1109/lics.2015.55openalex-snapshot
Feedback Turing Computability, and Turing Computability as Feedback
inferred← citeshttps://doi.org/10.1215/00294527-3832619openalex-snapshot
Infinite Computations with Random Oracles
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-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.70675/2f4d7cf2zf7d3z4d7azbdc6z85ef4e6bdca8openalex-snapshot
Toward higher-order and many-symbol infinite time Turing machines
showing the first 23 of 24 · page through all 24
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.