Index sets in computable analysis

DOI10.1016/S0304-3975(98)00286-2zbMath0916.68052OpenAlexW2095378827MaRDI QIDQ1292400

Douglas Cenzer, Jeffery B. Remmel

Publication date: 21 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00286-2

zbMATH Keywords

index setcomputable analysisPi-0-1 class

Mathematics Subject Classification ID

Related Items (8)

Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Effectiveness for Embedded Spheres and Balls ⋮ Decision problems for Turing machines ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computable analysis and classification problems ⋮ Effectively closed sets and graphs of computable real functions.

Cites Work

• Recursively presented games and strategies
• \(\omega\)-computations on Turing machines
• 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
• Computability in Analysis and Physics
• 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

This page was built for publication: Index sets in computable analysis