Index sets in computable analysis

DOI10.1016/S0304-3975(98)00286-2MaRDI QIDQ1292400zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Jeffrey 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

computable analysisindex setPi-0-1 class

Mathematics Subject Classification ID

Recommendations

• Index sets as a measure of continuous constraint complexity
• Index sets for computable differential equations
• Computable elements and functions in effectively enumerable topological spaces
• A tutorial on computable analysis

Cites work

• scientific article; zbMATH DE number 4019040 (Why is no real title available?)
• scientific article; zbMATH DE number 3112803 (Why is no real title available?)
• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 4039896 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3572138 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1303200 (Why is no real title available?)
• scientific article; zbMATH DE number 512868 (Why is no real title available?)
• scientific article; zbMATH DE number 2013199 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 749920 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Computability in analysis and physics
• Computable functionals
• Decision problems forω-automata
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Hierarchies of number-theoretic predicates
• Hyperarithmetical Index Sets in Recursion Theory
• Index sets for ^0_1 classes
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the definitions of computable real continuous functions
• Recursively presented games and strategies
• -computations on Turing machines
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(15)

• Computable elements and functions in effectively enumerable topological spaces
• Effectiveness for embedded spheres and balls
• Index sets as a measure of continuous constraint complexity
• Outline of partial computability in computable topology
• Computability of Polish spaces up to homeomorphism
• Index sets for computable differential equations
• Decision problems for Turing machines
• Computable analysis and classification problems
• The number of nonequivalent computable indexations for a fixed family of sets
• Rice's theorem in effectively enumerable topological spaces
• scientific article; zbMATH DE number 749926 (Why is no real title available?)
• On the index sets of \(\Sigma\)-subsets of the real numbers
• On Index Sets of Some Properties of Computable Algebras
• Effectively closed sets and graphs of computable real functions.
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292400)