The computational complexity of some Julia sets

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 177-185

  Rettinger, Robert ^a   Weihrauch, Klaus ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Computational complexity; Julia sets

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; ERROR ANALYSIS; FUNCTIONS; TURING MACHINES;

JULIA SETS;

COMPUTATION THEORY;

EID: 0038447006     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780569.780570     Document Type: Conference Paper

References (12)

1. M. F. Barnsley. Fractals Everywhere. Academic Press, Boston, 2nd edition, 1993.
2. R. L. Devaney. An introduction to chaotic dynamical systems. Addison-Wesley, Redwood City, 2nd edition, 1989.
3. R. Engelking. General Topology, volume 6 of Sigma series in pure mathematics. Heldermann, Berlin, 1989.
4. K. Falconer. Fractal Geometry. Mathematical Foundations and Applications. John Wiley & Sons, Chichester, New York, 1990.
5. H. Kamo, K. Kawamura, and I. Takeuti. Computational complexity of fractal sets. Real Analysis Exchange, 26(2):773-793, 2000/01.
6. J. Milnor. Dynamics in One Complex Variable. Vieweg, Braunschweig, 2nd edition, 2000.
7. H.-O. Peitgen, H. Jürgens, and D. Saupe. Fractals for the classroom, Part Two, Complex systems and Mandelbrot set. Springer, 1992.
8. H.-O. Peitgen and P. H. Richter. The beauty of fractals. Images of complex dynamical systems. Springer, Berlin, 1986.
9. D. Saupe. Efficient computation of Julia sets and their fractal dimension. Physica, 28D:358-370, 1987.
10. K. Weihrauch. Computable Analysis. Springer, Berlin, 2000.
11. K. Weihrauch. Computational complexity on computable metric spaces. Mathematical Logic Quarterly, 49(1):3-21, 2003.
12. q in two computing models: Blum-Shub-Smale machine and Turing machine. Theoretical Computer Science, 197:79-94, 1998.