Characterizations of ITBM-computability. I
Algebra i logika, Tome 59 (2020) no. 6, pp. 627-648

Voir la notice de l'article provenant de la source Math-Net.Ru

We examine whether some well-known properties of partial recursive functions are valid for ITBM-computable functions, i.e., functions which can be computed with infinite time Blum–Shub–Smale machines. It is shown that properties of graphs of ITBM-computable functions differ from the usual properties of graphs of partial recursive functions. All possible ranges of ITBM-computable functions are described, and we consider the existence problem for ITBM-computable bijections between ITBM-computable sets of the same cardinality.
Keywords: Blum–Shub–Smale machine, ITBM-computable functions, partial recursive functions, graph of function.
@article{AL_2020_59_6_a1,
     author = {P. Koepke and A. S. Morozov},
     title = {Characterizations of {ITBM-computability.~I}},
     journal = {Algebra i logika},
     pages = {627--648},
     publisher = {mathdoc},
     volume = {59},
     number = {6},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2020_59_6_a1/}
}
TY  - JOUR
AU  - P. Koepke
AU  - A. S. Morozov
TI  - Characterizations of ITBM-computability. I
JO  - Algebra i logika
PY  - 2020
SP  - 627
EP  - 648
VL  - 59
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2020_59_6_a1/
LA  - ru
ID  - AL_2020_59_6_a1
ER  - 
%0 Journal Article
%A P. Koepke
%A A. S. Morozov
%T Characterizations of ITBM-computability. I
%J Algebra i logika
%D 2020
%P 627-648
%V 59
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2020_59_6_a1/
%G ru
%F AL_2020_59_6_a1
P. Koepke; A. S. Morozov. Characterizations of ITBM-computability. I. Algebra i logika, Tome 59 (2020) no. 6, pp. 627-648. http://geodesic.mathdoc.fr/item/AL_2020_59_6_a1/