Degrees of unsolvability of continuous functions

DOI10.2178/jsl/1082418543zbMath1070.03026OpenAlexW2118835180MaRDI QIDQ5311741

Joseph S. Miller

Publication date: 29 August 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.2282

zbMATH Keywords

Scott setcomputable analysiscontinuous degreescomplexity of continuous functionsdegrees of continuous functions

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Genericity of weakly computable objects, Three topological reducibilities for discontinuous functions, Alan Turing and the Foundations of Computable Analysis, Cototal enumeration degrees and their applications to effective mathematics, A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES, Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, PA RELATIVE TO AN ENUMERATION ORACLE, Density of the cototal enumeration degrees, On Turing degrees of points in computable topology, Limit complexities revisited, The Brouwer invariance theorems in reverse mathematics, Unnamed Item, Computability theory. Abstracts from the workshop held January 7--13, 2018, The power of backtracking and the confinement of length, FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS, Notes on computable analysis, Effectively closed sets of measures and randomness, An effective Carathéodory theorem, Defining totality in the enumeration degrees, Characterizing the continuous degrees, Computable metrics above the standard real metric, Algorithmic tests and randomness with respect to a class of measures, On cototality and the skip operator in the enumeration degrees, Highness properties close to PA completeness, ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY, Computable randomness and betting for computable probability spaces, Turing degrees in Polish spaces and decomposability of Borel functions, Randomness for non-computable measures, Cone avoidance and randomness preservation, Point Degree Spectra of Represented Spaces, Probabilistic computability and choice, Computability of Subsets of Metric Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Theory of representations
• First-order theory of the degrees of recursive unsolvability
• Definability in the enumeration degrees
• Computability on computable metric spaces
• The recursively enumerable degrees are dense
• A generalization of Brouwer's fixed point theorem
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• Arithmetical Reducibilities I
• Class groups of integral group rings
• Fixed Point Theorems for Multi-Valued Transformations