The lost melody theorem for infinite time Blum-Shub-Smale machines

DOI10.1007/978-3-030-80049-9_7OpenAlexW3178947426MaRDI QIDQ2117767

Merlin Carl

Publication date: 22 March 2022

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

zbMATH Keywords

admissibilityrecognizabilityordinal computabilityinfinite time Blum-Shub-Smale machines

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

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

Cites Work

• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• Ordinal computability. An introduction to infinitary machines
• The basic theory of infinite time register machines
• Rudimentary recursion, gentle functions and provident sets
• The computational power of infinite time Blum-Shub-Smale machines
• The distribution of ITRM-recognizable reals
• Towards a Theory of Infinite Time Blum-Shub-Smale Machines
• Discrete Transfinite Computation
• An Enhanced Theory of Infinite Time Register Machines
• Gaps in the contructable universe
• Infinite time Turing machines
• The Lost Melody Phenomenon
• Provident sets and rudimentary set forcing
• On the Semantics of the Constructible Levels
• Degrees of unsolvability of constructible sets of integers
• The fine structure of the constructible hierarchy
• Logical Approaches to Computational Barriers

This page was built for publication: The lost melody theorem for infinite time Blum-Shub-Smale machines