On some computability notions for real functions
From MaRDI portal
Recommendations
Cited in
(19)- A new approach to computability over the reals
- A Banach-Mazur computable but not Markov computable function on the computable real numbers
- Conditional computability of real functions with respect to a class of operators
- Towards computable analysis on the generalised real line
- 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
- The realizability problem for Golovach-type functions
- scientific article; zbMATH DE number 1191234 (Why is no real title available?)
- Some Elementary Results About the Equivalence of Computability and Decidability
- scientific article; zbMATH DE number 1088270 (Why is no real title available?)
- Some characterizations of functions computable in on-line arithmetic
- scientific article; zbMATH DE number 1796999 (Why is no real title available?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- scientific article; zbMATH DE number 7360045 (Why is no real title available?)
- Beyond Rogers’ Non-constructively Computable Function
- \(\text{P}\neq \text{NP}\) for the reals with various analytic functions
- 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 some computability notions for real functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851190)
