Singular coverings and non‐uniform notions of closed set computability

DOI10.1002/MALQ.200610058zbMATH Open1153.03043OpenAlexW2046783159MaRDI QIDQ3528149FDOQ3528149

Authors: Stéphane Le Roux, Martin Ziegler 

Publication date: 8 October 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200610058

Recommendations

• Singular coverings and non-uniform notions of closed set computability
• Closed sets and operators thereon: representations, computability and complexity
• Computability on Subsets of Locally Compact Spaces
• Universal singular sets and unrectifiability
• scientific article; zbMATH DE number 1873436
• Computability of Følner sets
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Complete sets and closeness to complexity classes
• scientific article; zbMATH DE number 5064948
• Continuity and computability of reachable sets

zbMATH Keywords

connected componentco-r.e. closed setsnon-uniform computability

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Arithmetical Hierarchy of Real Numbers
• Title not available (Why is that?)
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Effective Borel measurability and reducibility of functions
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable operators on regular sets
• Title not available (Why is that?)
• Logical Approaches to Computational Barriers
• Relatively recursive reals and real functions

Cited In (12)

• Computability of Subsets of Metric Spaces
• Singular coverings and non-uniform notions of closed set computability
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Co-c.e. sets with disconnected complements
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Computability and analysis, a historical approach
• Computable Closed Euclidean Subsets with and without Computable Points
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• The cohesive principle and the Bolzano-Weierstraß principle
• Connected choice and the Brouwer fixed point theorem
• Computable neighbourhoods of points in semicomputable manifolds
• Semicomputable manifolds in computable topological spaces

This page was built for publication: Singular coverings and non‐uniform notions of closed set computability

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