Hypercomputing the Mandelbrot Set?

Details Hypercomputing the Mandelbrot Set? Hypercomputing the Mandelbrot Set?

2006-04-02

arxiv.org/abs/cs/0604003v1

Computer Science

Computational Complexity

11 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hypercomputing the Mandelbrot Set? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hypercomputing the Mandelbrot Set?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypercomputing the Mandelbrot Set? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173231