Taming Koepke's Zoo II: Register Machines
Fuente:
arXiv
Saved in:
| Main Author: | Carl, Merlin |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)
by: Carl, Merlin
Published: (2014)
Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015)
by: Carl, Merlin
Published: (2015)
Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)
by: Carl, Merlin
Published: (2018)
A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)
by: Carl, Merlin
Published: (2019)
Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)
by: Carl, Merlin
Published: (2019)
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
by: Carl, Merlin
Published: (2020)
by: Carl, Merlin
Published: (2020)
Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)
by: Carl, Merlin
Published: (2024)
A Note on OTM-Realizability and Constructive Set Theories
by: Carl, Merlin
Published: (2019)
by: Carl, Merlin
Published: (2019)
The Lost Melody Phenomenon
by: Carl, Merlin
Published: (2014)
by: Carl, Merlin
Published: (2014)
Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
by: Carl, Merlin
Published: (2015)
by: Carl, Merlin
Published: (2015)
Structures Associated with Real Closed Fields and the Axiom of Choice
by: Carl, Merlin
Published: (2014)
by: Carl, Merlin
Published: (2014)
Space-Bounded OTMs and REG$^{\infty}$
by: Carl, Merlin
Published: (2017)
by: Carl, Merlin
Published: (2017)
Recognizable Realizability
by: Carl, Merlin
Published: (2024)
by: Carl, Merlin
Published: (2024)
Reduction Complexities in Set Theory
by: Carl, Merlin
Published: (2025)
by: Carl, Merlin
Published: (2025)
Optimal Results on ITRM-recognizability
by: Carl, Merlin
Published: (2013)
by: Carl, Merlin
Published: (2013)
The distribution of ITRM-recognizable reals
by: Carl, Merlin
Published: (2012)
by: Carl, Merlin
Published: (2012)
Models of true arithmetic are integer parts of nice real closed fields
by: Carl, Merlin
Published: (2013)
by: Carl, Merlin
Published: (2013)
Lower bounds on $β(α)$ and other properties of $α$-ITRMs
by: Carl, Merlin
Published: (2021)
by: Carl, Merlin
Published: (2021)
A Note on Power-OTMs
by: Carl, Merlin
Published: (2024)
by: Carl, Merlin
Published: (2024)
Some Observations on Infinitary Complexity
by: Carl, Merlin
Published: (2018)
by: Carl, Merlin
Published: (2018)
The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
by: Carl, Merlin
Published: (2022)
by: Carl, Merlin
Published: (2022)
Generalized Effective Reducibility
by: Carl, Merlin
Published: (2016)
by: Carl, Merlin
Published: (2016)
Almost sure OTM-realizability
by: Carl, Merlin
Published: (2024)
by: Carl, Merlin
Published: (2024)
Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
by: Carl, Merlin
Published: (2023)
by: Carl, Merlin
Published: (2023)
Canonical Truth
by: Carl, Merlin, et al.
Published: (2017)
by: Carl, Merlin, et al.
Published: (2017)
Randomness via infinite computation and effective descriptive set theory
by: Carl, Merlin, et al.
Published: (2016)
by: Carl, Merlin, et al.
Published: (2016)
Improving the Diproche CNL through Autoformalization via Large Language Models
by: Carl, Merlin
Published: (2023)
by: Carl, Merlin
Published: (2023)
Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
by: Carl, Merlin, et al.
Published: (2015)
by: Carl, Merlin, et al.
Published: (2015)
Tameness Properties in Multiplicative Valued Difference Fields with Lift and Section
by: Kesting, Christoph
Published: (2024)
by: Kesting, Christoph
Published: (2024)
Tame pairs of transseries fields
by: Pynn-Coates, Nigel
Published: (2024)
by: Pynn-Coates, Nigel
Published: (2024)
T-Convexity, Tame Extensions and Definability of Hausdorff Limits in O-minimal Structures with Generic Derivations
by: Wang, Xiaoduo
Published: (2025)
by: Wang, Xiaoduo
Published: (2025)
Model-theoretic Tameness in finite extensions of groups
by: Halevi, Yatir, et al.
Published: (2026)
by: Halevi, Yatir, et al.
Published: (2026)
Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words
by: Piórkowski, Radosław
Published: (2026)
by: Piórkowski, Radosław
Published: (2026)
Strictly Monotone Numerosity on Tame Sets via the Steiner Polynomial
by: Previdi, Joseph T.
Published: (2020)
by: Previdi, Joseph T.
Published: (2020)
Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
by: Hausmann, Daniel, et al.
Published: (2025)
by: Hausmann, Daniel, et al.
Published: (2025)
Deep Learning as the Disciplined Construction of Tame Objects
by: Bareilles, Gilles, et al.
Published: (2025)
by: Bareilles, Gilles, et al.
Published: (2025)
Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them
by: Jamroga, Wojciech, et al.
Published: (2020)
by: Jamroga, Wojciech, et al.
Published: (2020)
RV32I in ACL2
by: Kwan, Carl
Published: (2025)
by: Kwan, Carl
Published: (2025)
Just Verification of Mutual Exclusion Algorithms with (Non-)Blocking and (Non-)Atomic Registers
by: van Glabbeek, Rob, et al.
Published: (2026)
by: van Glabbeek, Rob, et al.
Published: (2026)
Analogical proportions II
by: Antić, Christian
Published: (2024)
by: Antić, Christian
Published: (2024)
Similar Items
-
Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014) -
Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015) -
Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018) -
A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019) -
Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)