Computability of Julia sets [Documento electrónico] / Mark Braverman, Michael Yampolsky
Language: eng.Country: Germany.Publication: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009Description: XIII, 151 p.ISBN: 978-3-540-68547-0.Series: Algorithms and Computation in MathematicsSubject - Topical Name: Funções computáveis Online Resources:Click here to access onlineItem type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
E-Books | Biblioteca NOVA FCT Online | Não Ficção | QA9.59.SPR FCT 82148 (Browse shelf(Opens below)) | 1 | Available |
Colocação: Online
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 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.
There are no comments on this title.