Effectively closed sets and graphs of computable real functions.

DOI10.1016/S0304-3975(01)00069-XMaRDI QIDQ1607292zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Jeffrey Remmel

Publication date 31 July 2002

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

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00069-x

zbMATH Keywords

Computable analysis

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computability on subsets of Euclidean space. I: Closed and compact subsets
• scientific article; zbMATH DE number 1222103
• Relatively computable functions of real variables
• Closed sets and operators thereon: representations, computability and complexity
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions

Cites work

• scientific article; zbMATH DE number 4019040 (Why is no real title available?)
• scientific article; zbMATH DE number 3113502 (Why is no real title available?)
• scientific article; zbMATH DE number 3131932 (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 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1222088 (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 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3805536 (Why is no real title available?)
• scientific article; zbMATH DE number 749920 (Why is no real title available?)
• scientific article; zbMATH DE number 1390012 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable functionals
• Computational complexity of real functions
• 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 \(\Pi^0_1\) classes
• Index sets in computable analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the computability of fractal dimensions and Hausdorff measure
• On the definitions of computable real continuous functions
• Recursively presented games and strategies
• The computational complexity of maximization and integration
• \(\omega\)-computations on Turing machines
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(13)

• Computable symbolic dynamics
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• Plottable Real Number Functions and the Computable Graph Theorem
• Immunity for closed sets
• Conservatively approximable functions
• Random Continuous Functions
• Effective randomness of unions and intersections
• $\it \Pi^0_1$ Sets and Tilings
• The random members of a \({\Pi }_{1}^{0}\) class
• Effectively open real functions
• Singular coverings and non-uniform notions of closed set computability
• Approximating functions and measuring distance on a graph
• Effectively closed sets and enumerations

This page was built for publication: Effectively closed sets and graphs of computable real functions.

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