Pages that link to "Item:Q3091465"
From MaRDI portal
The following pages link to On a Relative Computability Notion for Real Functions (Q3091465):
Displaying 8 items.
- 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)
- (Q4364586) (← 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)
- Relatively computable functions of real variables (Q5954991) (← links)