Characterizations of ITBM-computability. I

DOI10.1007/S10469-021-09622-2OpenAlexW3142317440MaRDI QIDQ2026737

Peter Koepke, Andrey S. Morozov

Publication date: 20 May 2021

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-021-09622-2

zbMATH Keywords

partial recursive functionsgraph of functionBlum-Shub-Smale machineITBM-computable functions

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Related Items (1)

Characterizations of ITBM-computability. II

Cites Work

• Unnamed Item
• Unnamed Item
• Ordinal machines and admissible recursion theory
• The basic theory of infinite time register machines
• The computational power of infinite time Blum-Shub-Smale machines
• Towards a Theory of Infinite Time Blum-Shub-Smale Machines
• Discrete Transfinite Computation
• Ordinal Computability
• A Survey of Infinite Time Turing Machines
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Characterizations of ITBM-computability. I