Three concepts of decidability for general subsets of uncountable spaces
type: Item
instance of: scholarly article
title: Three concepts of decidability for general subsets of uncountable spaces
zbMATH Open document ID: 1085.03045
author: Matthew W. Parker
published in: Theoretical Computer Science
publication date: 2006-03-20T00:00:00Z
full work available at URL: PARD-3
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 03D80
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 5013345
zbMATH Keywords: computable analysis
zbMATH Keywords: recursive sets
zbMATH Keywords: recursively approximable sets
zbMATH Keywords: undecidability
MaRDI profile type: Publication
OpenAlex ID: W2149388189
cites work: RIDDLED BASINS
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets
cites work: Computable functionals
cites work: On the definition of computable functionals
cites work: On the definitions of computable real continuous functions
cites work: Approximate decidability in euclidean spaces
cites work: Q4002474
cites work: Q3722498
cites work: Computability of convex sets
cites work: Q4530487
cites work: Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
cites work: Q5556429
cites work: Q4040892
cites work: Intermingled basins of attraction: uncomputability in a simple physical system
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: Type 2 recursion theory
cites work: Q4485693
cites work: Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
cites work: Computability on Regular Subsets of Euclidean Space
DOI: 10.1016/J.TCS.2005.09.052
description: scientific article; zbMATH DE number 5013345