Logical Approaches to Computational Barriers

Hypercomputing the Mandelbrot Set?

Speaker:
| Petrus Hendrik Potgieter |

Slot: |
Array, 11:10-11:30, col. 3 |

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 are treated much more thoroughly and technically elsewhere), two over the computable reals (the Russian school and hypercomputation) and one model over the rationals.

websites: Arnold Beckmann | 2006-07-03 |