The arithmetic hierarchy of real functions
From MaRDI portal
Cites work
- A comparison of concepts from computable analysis and effective descriptive set theory
- A fundamental effect in computations on real numbers
- A Galois connection between Turing jumps and limits
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- COMPUTABLY COMPACT METRIC SPACES
- Descriptive set theory in the category of represented spaces
- Effective Borel measurability and reducibility of functions
- scientific article; zbMATH DE number 3577197 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Limiting recursion
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic sequences and degree spectra of structures
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On degrees of unsolvability
- On the computability of Solomonoff induction and AIXI
- Primitive recursive real numbers
- Real hypercomputation and continuity
- Recursive Predicates and Quantifiers
- Revising type-2 computation and degrees of discontinuity
- The Arithmetical Hierarchy of Real Numbers
- The foundations of spectral computations via the solvability complexity index hierarchy
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
This page was built for publication: The arithmetic hierarchy of real functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286067)