Imagen de Portada

Taming Koepke's Zoo II: Register Machines

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Carl, Merlin
Formato:	Preprint
Publicado:	2019
Materias:	Logic
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Algorithmic Randomness for Infinite Time Register Machines
por: Carl, Merlin
Publicado: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
por: Carl, Merlin
Publicado: (2015)

Effectivity and Reducibility with Ordinal Turing Machines
por: Carl, Merlin
Publicado: (2018)

A Note on Clockability for Ordinal Turing Machines
por: Carl, Merlin
Publicado: (2019)

Space and Time Complexity for Infinite Time Turing Machines
por: Carl, Merlin
Publicado: (2019)

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

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

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

The Lost Melody Phenomenon
por: Carl, Merlin
Publicado: (2014)

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

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

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

Recognizable Realizability
por: Carl, Merlin
Publicado: (2024)

Reduction Complexities in Set Theory
por: Carl, Merlin
Publicado: (2025)

Optimal Results on ITRM-recognizability
por: Carl, Merlin
Publicado: (2013)

The distribution of ITRM-recognizable reals
por: Carl, Merlin
Publicado: (2012)

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

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

A Note on Power-OTMs
por: Carl, Merlin
Publicado: (2024)

Some Observations on Infinitary Complexity
por: Carl, Merlin
Publicado: (2018)

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
por: Carl, Merlin
Publicado: (2022)

Generalized Effective Reducibility
por: Carl, Merlin
Publicado: (2016)

Almost sure OTM-realizability
por: Carl, Merlin
Publicado: (2024)

Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
por: Carl, Merlin
Publicado: (2023)

Canonical Truth
por: Carl, Merlin, et al.
Publicado: (2017)

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

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

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

Tameness Properties in Multiplicative Valued Difference Fields with Lift and Section
por: Kesting, Christoph
Publicado: (2024)

Tame pairs of transseries fields
por: Pynn-Coates, Nigel
Publicado: (2024)

T-Convexity, Tame Extensions and Definability of Hausdorff Limits in O-minimal Structures with Generic Derivations
por: Wang, Xiaoduo
Publicado: (2025)

Model-theoretic Tameness in finite extensions of groups
por: Halevi, Yatir, et al.
Publicado: (2026)

Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words
por: Piórkowski, Radosław
Publicado: (2026)

Strictly Monotone Numerosity on Tame Sets via the Steiner Polynomial
por: Previdi, Joseph T.
Publicado: (2020)

Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
por: Hausmann, Daniel, et al.
Publicado: (2025)

Deep Learning as the Disciplined Construction of Tame Objects
por: Bareilles, Gilles, et al.
Publicado: (2025)

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them
por: Jamroga, Wojciech, et al.
Publicado: (2020)

RV32I in ACL2
por: Kwan, Carl
Publicado: (2025)

Just Verification of Mutual Exclusion Algorithms with (Non-)Blocking and (Non-)Atomic Registers
por: van Glabbeek, Rob, et al.
Publicado: (2026)

Analogical proportions II
por: Antić, Christian
Publicado: (2024)