All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines

DOI10.1007/978-3-031-36978-0_7arXiv2205.04939OpenAlexW4384789919MaRDI QIDQ6149032

Merlin Carl

Publication date: 12 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.04939

zbMATH Keywords

constructibilitydefinabilityrecognizabilityordinal computabilityinfinite time register machines

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Register computations on ordinals
• Ordinal machines and admissible recursion theory
• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• Ordinal computability. An introduction to infinitary machines
• Taming Koepke's zoo. II: Register machines
• The lost melody theorem for infinite time Blum-Shub-Smale machines
• The distribution of ITRM-recognizable reals
• OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES
• What is the theory without power set?
• An Enhanced Theory of Infinite Time Register Machines
• Ordinal Computability
• Infinite time Turing machines
• The Lost Melody Phenomenon
• Admissible Sets and Structures
• Logical Approaches to Computational Barriers

This page was built for publication: All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines