Hypercomputing the Mandelbrot Set?
| dc.creator | Potgieter, Petrus H. | |
| dc.date | 2006-04-02 | |
| dc.date.accessioned | 2026-07-07T07:09:18Z | |
| dc.date.available | 2026-07-07T07:09:18Z | |
| dc.description | The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper surveys some results that are known concerning the (non-)computability of the set. It considers two models of decidability over the reals (which have been treated much more thoroughly and technically by Hertling (2005), Blum, Shub and Smale, Brattka (2003) and Weihrauch (1999 and 2003) among others), two over the computable reals (the Russian school and hypercomputation) and a model over the rationals. | |
| dc.description | 11 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0604003 | |
| dc.identifier | http://arxiv.org/abs/cs/0604003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111010 | |
| dc.subject | Computational Complexity | |
| dc.subject | F.1.1 | |
| dc.title | Hypercomputing the Mandelbrot Set? | |
| dc.type | text |