Imagen de Portada

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

Fuente: arXiv

Guardado en:

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

Ejemplares similares

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

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

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

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

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

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

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

Congruence Preservation, Lattices and Recognizability
por: Cegielski, Patrick, et al.
Publicado: (2024)

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

Iterability for (transfinite) stacks
por: Schlutzenberg, Farmer
Publicado: (2018)

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

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

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

Taming Koepke's Zoo II: Register Machines
por: Carl, Merlin
Publicado: (2019)

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

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

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

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)

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

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

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

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

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

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

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

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

Full normalization for transfinite stacks
por: Schlutzenberg, Farmer
Publicado: (2021)

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

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)

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

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

Shininess, strong politeness, and unicorns
por: Przybocki, Benjamin, et al.
Publicado: (2025)

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

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

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

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