Is the Mandelbrot set computable?

Mathematical Logic Quarterly 51 (1):5-18 (2005)
  Copy   BIBTEX

Abstract

This work is concerned with the question whether the Mandelbrot set is computable. The computability notions that we consider are studied in computable analysis and will be introduced and discussed. We show that the exterior of the Mandelbrot set, the boundary of the Mandelbrot set, and the hyperbolic components satisfy certain natural computability conditions. We conclude that the two-sided distance function of the Mandelbrot set is computable if the famous hyperbolicity conjecture is true. We also formulate the question whether the distance function of the Mandelbrot set is computable in terms of the escape time

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-10-31

Downloads
22 (#968,280)

6 months
5 (#1,035,390)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references