Image de couverture de livre

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2022
Sujets:	Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Recognizable Realizability
par: Carl, Merlin
Publié: (2024)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
par: Carl, Merlin
Publié: (2015)

The Lost Melody Phenomenon
par: Carl, Merlin
Publié: (2014)

Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
par: Carl, Merlin, et autres
Publié: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
par: Carl, Merlin
Publié: (2020)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
par: Carl, Merlin
Publié: (2021)

Randomness via infinite computation and effective descriptive set theory
par: Carl, Merlin, et autres
Publié: (2016)

Congruence Preservation, Lattices and Recognizability
par: Cegielski, Patrick, et autres
Publié: (2024)

Searching problems above arithmetical transfinite recursion
par: Suzuki, Yudai, et autres
Publié: (2023)

Iterability for (transfinite) stacks
par: Schlutzenberg, Farmer
Publié: (2018)

Randomness and Degree Theory for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2015)

Structures Associated with Real Closed Fields and the Axiom of Choice
par: Carl, Merlin
Publié: (2014)

Space-Bounded OTMs and REG$^{\infty}$
par: Carl, Merlin
Publié: (2017)

A Note on OTM-Realizability and Constructive Set Theories
par: Carl, Merlin
Publié: (2019)

Algorithmic Randomness for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2014)

Taming Koepke's Zoo II: Register Machines
par: Carl, Merlin
Publié: (2019)

Reduction Complexities in Set Theory
par: Carl, Merlin
Publié: (2025)

Optimal Results on ITRM-recognizability
par: Carl, Merlin
Publié: (2013)

A Note on Clockability for Ordinal Turing Machines
par: Carl, Merlin
Publié: (2019)

The distribution of ITRM-recognizable reals
par: Carl, Merlin
Publié: (2012)

Models of true arithmetic are integer parts of nice real closed fields
par: Carl, Merlin
Publié: (2013)

A Note on Power-OTMs
par: Carl, Merlin
Publié: (2024)

Some Observations on Infinitary Complexity
par: Carl, Merlin
Publié: (2018)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2024)

Generalized Effective Reducibility
par: Carl, Merlin
Publié: (2016)

Effectivity and Reducibility with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2018)

Space and Time Complexity for Infinite Time Turing Machines
par: Carl, Merlin
Publié: (2019)

Almost sure OTM-realizability
par: Carl, Merlin
Publié: (2024)

Relative leftmost path principles and omega-model reflections of transfinite inductions
par: Suzuki, Yudai
Publié: (2024)

Full normalization for transfinite stacks
par: Schlutzenberg, Farmer
Publié: (2021)

Toward higher-order infinite time Turing machines: simulational $Γ$-machines
par: Bournez, Olivier, et autres
Publié: (2025)

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

Canonical Truth
par: Carl, Merlin, et autres
Publié: (2017)

Improving the Diproche CNL through Autoformalization via Large Language Models
par: Carl, Merlin
Publié: (2023)

Well-quasi-orders on finite trees and transfinite sequences
par: Chopra, Alakh Dhruv, et autres
Publié: (2026)

Shininess, strong politeness, and unicorns
par: Przybocki, Benjamin, et autres
Publié: (2025)

On evaluating the measure of strong projections in infinite dimension
par: Ferenczi, Miklos
Publié: (2026)

Uncountable sets and an infinite linear order game
par: Matos-Wiederhold, Tonatiuh, et autres
Publié: (2024)

Bisimilarity in fresh-register automata
par: Murawski, Andrzej S., et autres
Publié: (2020)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)