Effectively closed sets and graphs of computable real functions.

DOI10.1016/S0304-3975(01)00069-XzbMath1039.03033MaRDI QIDQ1607292

Douglas Cenzer, Jeffery B. Remmel

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computable analysis

Mathematics Subject Classification ID

03D45: Theory of numerations, effectively presented structures

Related Items

Random Continuous Functions, Effectively closed sets and enumerations, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, Effective randomness of unions and intersections, $\it \Pi^0_1$ Sets and Tilings, Computable symbolic dynamics, Immunity for Closed Sets

Cites Work

• The computational complexity of maximization and integration
• Computational complexity of real functions
• Recursively presented games and strategies
• \(\omega\)-computations on Turing machines
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Index sets in computable analysis
• On the computability of fractal dimensions and Hausdorff measure
• Index sets for \(\Pi^0_1\) classes
• Classical recursion theory. Vol. II
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Hierarchies of number-theoretic predicates
• Computable functionals
• On the definitions of computable real continuous functions
• Hyperarithmetical Index Sets in Recursion Theory
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Decision problems forω-automata
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item