Cover Image

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

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

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

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

Congruence Preservation, Lattices and Recognizability
by: Cegielski, Patrick, et al.
Published: (2024)

Searching problems above arithmetical transfinite recursion
by: Suzuki, Yudai, et al.
Published: (2023)

Iterability for (transfinite) stacks
by: Schlutzenberg, Farmer
Published: (2018)

Randomness and Degree Theory for Infinite Time Register Machines
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)

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

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)

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

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)

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

Some Observations on Infinitary Complexity
by: Carl, Merlin
Published: (2018)

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

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)

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

Relative leftmost path principles and omega-model reflections of transfinite inductions
by: Suzuki, Yudai
Published: (2024)

Full normalization for transfinite stacks
by: Schlutzenberg, Farmer
Published: (2021)

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

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)

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

Well-quasi-orders on finite trees and transfinite sequences
by: Chopra, Alakh Dhruv, et al.
Published: (2026)

Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)

On evaluating the measure of strong projections in infinite dimension
by: Ferenczi, Miklos
Published: (2026)

Uncountable sets and an infinite linear order game
by: Matos-Wiederhold, Tonatiuh, et al.
Published: (2024)

Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)