Cover Image

A Note on Clockability for Ordinal Turing Machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Carl, Merlin
Format:	Preprint
Published:	2019
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

A Note on Power-OTMs
by: Carl, Merlin
Published: (2024)

A Note on OTM-Realizability and Constructive Set Theories
by: Carl, Merlin
Published: (2019)

Taming Koepke's Zoo II: Register Machines
by: Carl, Merlin
Published: (2019)

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)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
by: Carl, Merlin
Published: (2020)

The Lost Melody Phenomenon
by: Carl, Merlin
Published: (2014)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
by: Carl, Merlin
Published: (2015)

Structures Associated with Real Closed Fields and the Axiom of Choice
by: Carl, Merlin
Published: (2014)

Space-Bounded OTMs and REG$^{\infty}$
by: Carl, Merlin
Published: (2017)

Recognizable Realizability
by: Carl, Merlin
Published: (2024)

Reduction Complexities in Set Theory
by: Carl, Merlin
Published: (2025)

Optimal Results on ITRM-recognizability
by: Carl, Merlin
Published: (2013)

The distribution of ITRM-recognizable reals
by: Carl, Merlin
Published: (2012)

Models of true arithmetic are integer parts of nice real closed fields
by: Carl, Merlin
Published: (2013)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
by: Carl, Merlin
Published: (2021)

Some Observations on Infinitary Complexity
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)

Generalized Effective Reducibility
by: Carl, Merlin
Published: (2016)

Almost sure OTM-realizability
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)

Canonical Truth
by: Carl, Merlin, et al.
Published: (2017)

Randomness via infinite computation and effective descriptive set theory
by: Carl, Merlin, et al.
Published: (2016)

Constructive Ordinal Exponentiation
by: de Jong, Tom, et al.
Published: (2025)

The subTuring degrees
by: Kihara, Takayuki, et al.
Published: (2024)

Improving the Diproche CNL through Autoformalization via Large Language Models
by: Carl, Merlin
Published: (2023)

Incompleteness theorems via Turing category
by: Savelyev, Yasha
Published: (2024)

Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
by: Carl, Merlin, et al.
Published: (2015)

Polymorphic Ordinal Notations
by: Towsner, Henry
Published: (2025)

Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)

Turing Degrees of Hyperjumps
by: Jananthan, Hayden R., et al.
Published: (2021)

Fagin's Theorem for Semiring Turing Machines
by: Badia, Guillermo, et al.
Published: (2025)

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

A Dichotomy Theorem for Ordinal Ranks in MSO
by: Niwiński, Damian, et al.
Published: (2025)

Ordinal measures of the set of finite multisets
by: Vialard, Isa
Published: (2023)

Diagonalizing Through the $ω$-Chain: Iterated Self-Certification on Bounded Turing Machines and its Least Fixed Point
by: Sung, Miara
Published: (2026)

Toward higher-order infinite time Turing machines: simulational $Γ$-machines
by: Bournez, Olivier, et al.
Published: (2025)