| 書目名稱 | Computability of Julia Sets |
| 編輯 | Mark Braverman,Michael Yampolsky |
| 視頻video | http://file.papertrans.cn/233/232032/232032.mp4 |
| 概述 | The first book describing in detail some spectacular results on computation and complex dynamical systems..Includes supplementary material: |
| 叢書名稱 | Algorithms and Computation in Mathematics |
| 圖書封面 |  |
| 描述 | .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. . |
| 出版日期 | Book 2009 |
| 關(guān)鍵詞 | Computer; Julia set; complexity; computability; computational complexity; computer science; dynamische Sys |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-540-68547-0 |
| isbn_softcover | 978-3-642-08806-3 |
| isbn_ebook | 978-3-540-68547-0Series ISSN 1431-1550 |
| issn_series | 1431-1550 |
| copyright | Springer-Verlag Berlin Heidelberg 2009 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 11:49
發(fā)表于 2025-3-21 18:47:48
