Degrees of unsolvability of continuous functions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4168664
- scientific article; zbMATH DE number 4135927
- scientific article; zbMATH DE number 4081537
- scientific article; zbMATH DE number 4186317
- scientific article; zbMATH DE number 18748
- Unsolvability of some problems about piecewise-polynomial functions
- On the degree of approximation of continuous functions
- scientific article; zbMATH DE number 5367476
- scientific article; zbMATH DE number 4075733
- scientific article; zbMATH DE number 3914306
Cites work
- A generalization of Brouwer's fixed point theorem
- Arithmetical Reducibilities I
- Class groups of integral group rings
- Computability on computable metric spaces
- Definability in the enumeration degrees
- First-order theory of the degrees of recursive unsolvability
- Fixed Point Theorems for Multi-Valued Transformations
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On degrees of recursive unsolvability
- The recursively enumerable degrees are dense
- Theory of representations
Cited in
(46)- Density of the cototal enumeration degrees
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- Limit complexities revisited
- Computable metrics above the standard real metric
- Highness properties close to PA completeness
- Characterizing the continuous degrees
- Cone avoidance and randomness preservation
- Probabilistic computability and choice
- Genericity of weakly computable objects
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Algorithmic tests and randomness with respect to a class of measures
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Topological reducibilities for discontinuous functions and their structures
- Computable randomness and betting for computable probability spaces
- Randomness for non-computable measures
- Degrees of total algorithms versus degrees of honest functions
- Alan Turing and the foundations of computable analysis
- On Turing degrees of points in computable topology
- scientific article; zbMATH DE number 3926899 (Why is no real title available?)
- scientific article; zbMATH DE number 3946115 (Why is no real title available?)
- Priority arguments in the continuous r.e. degrees
- scientific article; zbMATH DE number 979885 (Why is no real title available?)
- scientific article; zbMATH DE number 1009727 (Why is no real title available?)
- scientific article; zbMATH DE number 1746031 (Why is no real title available?)
- Cototal enumeration degrees and their applications to effective mathematics
- The information content of typical reals
- The power of backtracking and the confinement of length
- On cototality and the skip operator in the enumeration degrees
- Turing degrees in Polish spaces and decomposability of Borel functions
- Computability of Subsets of Metric Spaces
- Stashing and parallelization pentagons
- Three topological reducibilities for discontinuous functions
- A structural dichotomy in the enumeration degrees
- The Brouwer invariance theorems in reverse mathematics
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Notes on computable analysis
- On a metric generalization of the \(tt\)-degrees and effective dimension theory
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces
- Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms
- PA RELATIVE TO AN ENUMERATION ORACLE
- An effective Carathéodory theorem
- Computable one-way functions on the reals
- The geometry of computable Banach spaces
- Effectively closed sets of measures and randomness
This page was built for publication: Degrees of unsolvability of continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311741)
