Computability on subsets of metric space
β
Vasco Brattka; Gero Presser
π
Article
π
2003
π
Elsevier Science
π
English
β 524 KB
The notions "recursively enumerable" and "recursive" are the basic notions of e ectivity in classical recursion theory. In computable analysis, these notions are generalized to closed subsets of Euclidean space using their metric distance functions. We study a further generalization of these concept