Hypercomputing the Mandelbrot Set?
Petrus H. Potgieter
Abstract
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.
Create a lesson
Related papers
Hardness Self-Amplification in Linear Algebra and Fine-Grained Cryptography
Geoffroy Couteau, Nikolas Melissaris, Thejas Radhika Sajith
Lower Bounds for Adaptive Relaxed Locally Decodable Codes via the Capped Horvitz--Thompson Estimator
Guy Goldberg, Tom Gur, Sidhant Saraogi
Abelian embeddings make useful promises: approximation of detrivialised equations
Tamio-Vesa Nakajima, Zephyr Verwimp, Stanislav Živný
Entropy-Weighted Soundness for Multi-Answer Birthday Graphs
Alexandru Popa
Monodromy Computation Model
Xiaoyang Liu
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li