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
Pseudodeterminism and MA != NPBPP in Communication Complexity
Thomas Watson
Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-212 Circuits and Lower Bounds
Joshua A. Grochow, Gülce Kardeş, Michael Levet
Continuous Computational Social Choice: A Case Study in Bribery
Martin Koutecký, Nikolaos Melissinos, Tung Anh Vu et al.
Pseudorandom Functions in NC1 from LWE/LPN/CDH (Or: How to Build PRFs in NC1, Generically)
Youlong Ding, Aayush Jain, Ilan Komargodski
Parameterized Complexity of Lp-Lipschitz Constants for Input Convex Neural Networks and Lp-Norm Maximization over Zonotopes
Aritra Das, Vincent Froese, Moritz Grillo et al.
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan