Cover Image

A Note on Power-OTMs

Fuente: arXiv

Saved in:

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

Similar Items

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

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

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

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

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

Almost sure OTM-realizability
by: Carl, Merlin
Published: (2024)

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

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

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

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

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

Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)

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

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)

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

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

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)

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

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

Universal Proof Theory, TACL 2022 Lecture Notes
by: Iemhoff, Rosalie, et al.
Published: (2023)

Notes on the coexistence of limit notions
by: Yamazoe, Takashi
Published: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Notes on Laver Tables
by: Qi, Renrui
Published: (2025)

A Note on Proper Relational Structures
by: Bjorndahl, Adam, et al.
Published: (2025)

A Note on the Practice of Logical Inferentialism
by: Gheorghiu, Alexander V., et al.
Published: (2024)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
by: Wang, Shanxia
Published: (2026)

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

Categoricity without Power
by: Goh, Jun Le, et al.
Published: (2026)

A Note on a Theorem of Apter
by: Mohammadpour, Rahman, et al.
Published: (2026)

A Note On Square-free Sequences and Anti-unification Type
by: Cerna, David M.
Published: (2024)

Notes on slalom prediction
by: Yamazoe, Takashi
Published: (2025)