Publication:4585068
From MaRDI portal
DOI10.23638/LMCS-14(3:13)2018MaRDI QIDQ4585068
Publication date: 6 September 2018
Full work available at URL: https://arxiv.org/abs/1802.01355
lownessGalois connectionscomputable analysis1-genericitylimit computabilitycomputability relative to the halting problemrepresented spaces
Related Items
Completion of choice, SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE, WEIHRAUCH GOES BROUWERIAN
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- On degrees of recursive unsolvability
- Real functions and numbers defined by Turing machines
- Classical recursion theory. The theory of functions and sets of natural numbers
- General topology. I. Basic concepts and constructions. Dimension theory. Transl. from the Russian by D. B. O'Shea
- Computable invariance
- Relatively recursive reals and real functions
- Recursive characterization of computable real-valued functions and relations
- Topological properties of real number representations.
- Extended admissibility.
- On the uniform computational content of computability theory
- Ramsey methods in analysis
- Beyond recursive real functions
- Genericity of weakly computable objects
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- On degrees of unsolvability
- Real hypercomputation and continuity
- The Arithmetical Hierarchy of Real Numbers
- Turing Computability
- Effective genericity and differentiability
- Effective Choice and Boundedness Principles in Computable Analysis
- Is the Mandelbrot set computable?
- Effective Borel measurability and reducibility of functions
- Algorithmic Randomness and Complexity
- Computable functionals
- A criterion for completeness of degrees of unsolvability
- Arithmetische Operatoren
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- Arithmetische und Bairesche Operatoren
- Descriptive Set Theory in the Category of Represented Spaces
- Revising Type-2 Computation and Degrees of Discontinuity
- Levels of discontinuity, limit-computability, and jump operators
- Non-deterministic computation and the Jayne-Rogers Theorem
- Limiting recursion
- On the topological aspects of the theory of represented spaces
- A Separation Theorem for ∑ 1 1 Sets
