Affiliation:
1. Department of Decision Sciences , University of South Africa , Pretoria , South Africa
Abstract
Abstract
We consider several concepts of computability (recursiveness) for sets in Euclidean space. A list of four ideal properties for such sets is proposed and it is shown in a very elementary way that no notion can satisfy all four desiderata. Most notions introduced here are essentially based on separability of ℝ
n
and this is natural when thinking about operations on an actual digital computer where, in fact, rational numbers are the basis of everything. We enumerate some properties of some naïve but practical notions of recursive sets and contrast these with others, including the widely used and accepted notion of computable set developed by Weihrauch, Brattka and others which is based on the “Polish school” notion of a computable real function. We also offer a conjecture about the Mandelbrot set.
Reference18 articles.
1. [1] Ilona Bereczki. Nem elemi rekurzív függvény létezése. In Az Első Magyar Matematikai Kongresszus közleményei, Magyar Matematikai Kongresszus közleményei, pages 409–417, 1952. cited in [14] and also reviewed in Journal of Symbolic Logic.
2. [2] Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. Complexity and real computation. Springer-Verlag, New York, 1998. With a foreword by Richard M. Karp.10.1007/978-1-4612-0701-6
3. [3] Vasco Brattka. The emperor’s new recursiveness: the epigraph of the exponential function in two models of computability, pages 63–72. World Sci. Publ., River Edge, NJ, 2003.10.1142/9789812704979_0005
4. [4] Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space. I. Closed and compact subsets. Theoretical Computer Science, 219:65–93, 1999.10.1016/S0304-3975(98)00284-9
5. [5] Antonin Callard and Mathieu Hoyrup. Descriptive complexity on non-Polish spaces. In STACS 2020, volume 154 of 37th Symposium on Theoretical Aspects of Computer Science, page 16, 2020.