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

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

Merlin Carl

Publication date: 22 March 2022

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

zbMATH Keywords

recognizabilityadmissibilityordinal computabilityinfinite time Blum-Shub-Smale machines

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (2)

• All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines
• The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117767)