Three concepts of decidability for general subsets of uncountable spaces

DOI10.1016/j.tcs.2005.09.052zbMath1085.03045OpenAlexW2149388189MaRDI QIDQ817852

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

undecidabilityrecursive setscomputable analysisrecursively approximable sets

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type 2 recursion theory
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• 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
• Computable functionals
• On the definition of computable functionals
• On the definitions of computable real continuous functions
• RIDDLED BASINS
• Computability of convex sets
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computability on Regular Subsets of Euclidean Space
• Approximate decidability in euclidean spaces
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• On Computable Numbers, with an Application to the Entscheidungsproblem

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