Three concepts of decidability for general subsets of uncountable spaces

DOI10.1016/J.TCS.2005.09.052MaRDI QIDQ817852zbMATH OpenOpenAlexFDO

Authors Matthew W. Parker

Publication date 20 March 2006

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

Full work available at URL https://philpapers.org/rec/PARD-3

zbMATH Keywords

computable analysisundecidabilityrecursive setsrecursively approximable sets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)

Recommendations

• Approximate decidability in euclidean spaces
• Decidability in elementary analysis. I
• Decidability in analysis
• The discrete parts of approximately decidable sets in Euclidean spaces
• Computability on Regular Subsets of Euclidean Space

Cites work

• scientific article; zbMATH DE number 3952751 (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 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1748602 (Why is no real title available?)
• scientific article; zbMATH DE number 3271504 (Why is no real title available?)
• Approximate decidability in euclidean spaces
• Computability of convex sets
• Computability on Regular Subsets of Euclidean Space
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Computable functionals
• Intermingled basins of attraction: uncomputability in a simple physical system
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the definition of computable functionals
• On the definitions of computable real continuous functions
• RIDDLED BASINS
• Type 2 recursion theory
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System

Cited in

(6)

• Notions of Probabilistic Computability on Represented Spaces
• Computing the uncomputable; or, the discrete charm of second-order simulacra
• The discrete parts of approximately decidable sets in Euclidean spaces
• Multi-resolution cellular automata for real computation
• Decidability in analysis
• Approximate decidability in euclidean spaces

This page was built for publication: Three concepts of decidability for general subsets of uncountable spaces

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