Towards a theory of infinite time Blum-Shub-Smale machines

DOI10.1007/978-3-642-30870-3_41MaRDI QIDQ2904435zbMATH OpenOpenAlexFDO

Authors Peter Koepke, Benjamin Seyfferth

Publication date 14 August 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_41

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Turing machines and related notions (03D10)

Recommendations

• The computational power of infinite time Blum-Shub-Smale machines
• Surreal Blum-Shub-Smale machines
• Infinite time Turing machines
• Hypermachines
• Logical Approaches to Computational Barriers

Cited in

(15)

• A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
• An Enhanced Theory of Infinite Time Register Machines
• Hypermachines
• The lost melody theorem for infinite time Blum-Shub-Smale machines
• Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
• The computational strengths of \(\alpha\)-tape infinite time Turing machines
• Characterizations of ITBM-computability. I
• ITBM-constructive completions of algebras
• The computational power of infinite time Blum-Shub-Smale machines
• Higher type recursion for transfinite machine theory
• Characterizations of ITBM-computability. II
• scientific article; zbMATH DE number 4114603 (Why is no real title available?)
• Surreal Blum-Shub-Smale machines
• Taming Koepke's zoo. II: Register machines
• The basic theory of infinite time register machines

This page was built for publication: Towards a theory of 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 Q2904435)