Three concepts of decidability for general subsets of uncountable spaces

DOI10.1016/J.TCS.2005.09.052zbMATH Open1085.03045OpenAlexW2149388189MaRDI QIDQ817852FDOQ817852

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

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

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)

Cites Work

• 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?)
• RIDDLED BASINS
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable functionals
• Computability on Regular Subsets of Euclidean Space
• Title not available (Why is that?)
• Type 2 recursion theory
• Intermingled basins of attraction: uncomputability in a simple physical system
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• On the definition of computable functionals
• Title not available (Why is that?)
• Computability of convex sets
• Approximate decidability in euclidean spaces
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

Cited In (6)

• The discrete parts of approximately decidable sets in Euclidean spaces
• Notions of Probabilistic Computability on Represented Spaces
• Multi-Resolution Cellular Automata for Real Computation
• Computing the uncomputable; or, the discrete charm of second-order simulacra
• Approximate decidability in euclidean spaces
• Decidability in analysis

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)