The computational power of infinite time Blum-Shub-Smale machines
From MaRDI portal
Publication:2401544
DOI10.1007/s10469-017-9425-xzbMath1420.03111OpenAlexW2611460981MaRDI QIDQ2401544
Peter Koepke, Andrey S. Morozov
Publication date: 4 September 2017
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-017-9425-x
computable realsinfinite computationsBSS machinesinfinite time Blum-Shub-Smale machinesITBMiterated jump
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Characterizations of ITBM-computability. I ⋮ Characterizations of ITBM-computability. II ⋮ Taming Koepke's zoo. II: Register machines ⋮ Lower bounds on \(\beta (\alpha)\) ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines
Cites Work
This page was built for publication: The computational power of infinite time Blum-Shub-Smale machines
