eng
episciences.org
Logical Methods in Computer Science
1860-5974
2017-07-06
Volume 13, Issue 3
10.23638/LMCS-13(3:3)2017
3772
journal article
Characterization theorem for the conditionally computable real functions
Ivan Georgiev
The class of uniformly computable real functions with respect to a small
subrecursive class of operators computes the elementary functions of calculus,
restricted to compact subsets of their domains. The class of conditionally
computable real functions with respect to the same class of operators is a
proper extension of the class of uniformly computable real functions and it
computes the elementary functions of calculus on their whole domains. The
definition of both classes relies on certain transformations of infinitistic
names of real numbers. In the present paper, the conditional computability of
real functions is characterized in the spirit of Tent and Ziegler, avoiding the
use of infinitistic names.
https://lmcs.episciences.org/3772/pdf
Mathematics - Logic
F.1.1
F.1.3