Characterization theorem for the conditionally computable real functions
From MaRDI portal
Abstract: 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.
Recommendations
- Conditional computability of real functions with respect to a class of operators
- On a relative computability notion for real functions
- Uniform and conditional-computability of some nonelementary real functions
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- scientific article; zbMATH DE number 7360045
Cited in
(6)- Characterization of conditionally termable functions
- Conditional computability of real functions with respect to a class of operators
- On a relative computability notion for real functions
- scientific article; zbMATH DE number 1342214 (Why is no real title available?)
- Uniform and conditional-computability of some nonelementary real functions
- scientific article; zbMATH DE number 7360045 (Why is no real title available?)
This page was built for publication: Characterization theorem for the conditionally computable real functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278086)
