Overview
- The first book describing in detail some spectacular results on computation and complex dynamical systems.
- Includes supplementary material: sn.pub/extras
Part of the book series: Algorithms and Computation in Mathematics (AACIM, volume 23)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. Their beauty and complexity can be fascinating. They also hold a deep mathematical content.
Computational hardness of Julia sets is the main subject of this book. By definition, a computable set in the plane can be visualized on a computer screen with an arbitrarily high magnification. There are countless programs to draw Julia sets. Yet, as the authors have discovered, it is possible to constructively produce examples of quadratic polynomials, whose Julia sets are not computable. This result is striking - it says that while a dynamical system can be described numerically with an arbitrary precision, the picture of the dynamics cannot be visualized.
The book summarizes the present knowledge (most of it from the authors' own work) about the computational properties of Julia sets in a self-contained way. It is accessible to experts and students with interest in theoretical computer science or dynamical systems.
Reviews
From the reviews:
“The study of dynamical systems has at its core … a very computational feel. … One can feel the book trying to be self-contained … . The subject of the book is timely and important. … The questions posed and answered in the present book are natural and the approach well-suited to produce enlightening results. … The book is also generous … . It has the potential to inspire considerable future work in this intriguing field.” (Wesley Calvert, SIGACT News, Vol. 41 (1), 2010)
“Written in an accessible way with many explications, examples and illustrations. … this book sees the meeting of two worlds: computability theory and iteration of rational maps. It is a fruitful one … and a share of surprises. It is also a compendium of several years of research by the authors … together with a lot of new results. … a nice and quick introduction to both topics, and much of it is pleasant to read … . includes interesting discussions and presents stimulating conjectures.” (Arnaud Chéritat, Foundations of Computational Mathematics, Vol. 12, 2012)
Authors and Affiliations
About the authors
M. Braverman is an expert in Theoretical Computer Science, particularly in applications of computability to Complex Analysis and Dynamical Systems
M. Yampolsky is an expert in Dynamical Systems, particularly in Holomorphic Dynamics and Renormalization Theory
Bibliographic Information
Book Title: Computability of Julia Sets
Authors: Mark Braverman, Michael Yampolsky
Series Title: Algorithms and Computation in Mathematics
DOI: https://doi.org/10.1007/978-3-540-68547-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Hardcover ISBN: 978-3-540-68546-3Published: 26 November 2008
Softcover ISBN: 978-3-642-08806-3Published: 22 November 2010
eBook ISBN: 978-3-540-68547-0Published: 08 February 2009
Series ISSN: 1431-1550
Edition Number: 1
Number of Pages: XIII, 151
Topics: Algorithms, Algebra, Programming Techniques, Theory of Computation, Algorithm Analysis and Problem Complexity, Mathematics of Computing