Pages that link to "Item:Q2851190"
From MaRDI portal
The following pages link to On some computability notions for real functions (Q2851190):
Displaying 17 items.
- The realizability problem for Golovach-type functions (Q276878) (← links)
- A new approach to computability over the reals (Q1284389) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- Conditional computability of real functions with respect to a class of operators (Q1944333) (← links)
- Towards computable analysis on the generalised real line (Q2011660) (← links)
- Models of computation for partial functions on the reals (Q2258841) (← links)
- On subrecursive complexity of integration (Q2291373) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Some Elementary Results About the Equivalence of Computability and Decidability (Q3982257) (← links)
- (Q4364586) (← links)
- Some characterizations of functions computable in on-line arithmetic (Q4420054) (← links)
- (Q4551395) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- (Q4993805) (← links)
- Beyond Rogers’ Non-constructively Computable Function (Q5326358) (← links)
- \(\text{P}\neq \text{NP}\) for the reals with various analytic functions (Q5938579) (← links)
- Relatively computable functions of real variables (Q5954991) (← links)
