On a relative computability notion for real functions
From MaRDI portal
Recommendations
- Conditional computability of real functions with respect to a class of operators
- Characterization theorem for the conditionally computable real functions
- Uniform and conditional-computability of some nonelementary real functions
- On the Definition of Computable Function of a Real Variable
- Relatively computable functions of real variables
Cited in
(16)- Conditional computability of real functions with respect to a class of operators
- Models of computation for partial functions on the reals
- On subrecursive complexity of integration
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Relative computability and uniform continuity of relations
- scientific article; zbMATH DE number 4145899 (Why is no real title available?)
- Relativization of Real Numbers to a Universe
- On the Definition of Computable Function of a Real Variable
- scientific article; zbMATH DE number 1088270 (Why is no real title available?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Uniform and conditional-computability of some nonelementary real functions
- scientific article; zbMATH DE number 7360045 (Why is no real title available?)
- Characterization theorem for the conditionally computable real functions
- Beyond Rogers’ Non-constructively Computable Function
- Relatively computable functions of real variables
- scientific article; zbMATH DE number 7809184 (Why is no real title available?)
This page was built for publication: On a relative computability notion for real functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091465)
