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


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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ωω.

作者简介

P. Koepke

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

编辑信件的主要联系方式.
Email: Koepke@math.uni-bonn.de
德国, Endenicher Allee 60, Bonn, 53115

A. Morozov

Sobolev Institute of Mathematics; Novosibirsk State University

Email: Koepke@math.uni-bonn.de
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media New York, 2017