Towards a Theory of Infinite Time Blum-Shub-Smale Machines

DOI10.1007/978-3-642-30870-3_41zbMath1358.03049OpenAlexW187506723MaRDI QIDQ2904435

Benjamin Seyfferth, Peter Koepke

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

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

Related Items (6)

The computational power of infinite time Blum-Shub-Smale machines ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Characterizations of ITBM-computability. I ⋮ Taming Koepke's zoo. II: Register machines ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines

This page was built for publication: Towards a Theory of Infinite Time Blum-Shub-Smale Machines