The Computational Power of Infinite Time Blum–Shub–Smale Machines


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Functions that are computable on infinite time Blum–Shub–Smale machines (ITBM) are characterized via iterated Turing jumps, and we propose a normal form for these functions. It is also proved that the set of ITBM computable reals coincides with ℝ∩Lωω.

About the authors

P. Koepke

Math. Inst., Rheinische Friedrich–Wilhelms–Univ. Bonn

Author for correspondence.
Email: Koepke@math.uni-bonn.de
Germany, Endenicher Allee 60, Bonn, 53115

A. S. Morozov

Sobolev Institute of Mathematics; Novosibirsk State University

Email: Koepke@math.uni-bonn.de
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Springer Science+Business Media New York