Index sets in computable analysis

DOI10.1016/S0304-3975(98)00286-2zbMATH Open0916.68052OpenAlexW2095378827MaRDI QIDQ1292400FDOQ1292400

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

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

zbMATH Keywords

computable analysisindex setPi-0-1 class

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ∏ 0 1 Classes and Degrees of Theories
• \(\omega\)-computations on Turing machines
• Classical recursion theory. Vol. II
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Title not available (Why is that?)
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decision problems forω-automata
• Computable functionals
• Computability in analysis and physics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchies of number-theoretic predicates
• Hyperarithmetical Index Sets in Recursion Theory
• Index sets for \(\Pi^0_1\) classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursively presented games and strategies

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
• Rice's theorem in effectively enumerable topological spaces
• The number of nonequivalent computable indexations for a fixed family of sets
• Title not available (Why is that?)
• 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)