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

DOI10.1007/978-3-030-80049-9_7MaRDI QIDQ2117767zbMATH OpenOpenAlexFDO

Authors 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

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