Computability of Julia sets
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,...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edizione: | 1st ed. 2009. |
| Serie: | Algorithms and Computation in Mathematics
23 |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Description d'après consultation du 26 mars 2012 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computability of Julia sets, Mark Braverman, Michael Yampolsky, 2009, Berlin, Springer, 1 vol. (XIII-151 p.), Algorithms and computation in mathematics, 978-3-540-68546-3 |
Sommario:
- to Computability Dynamics of Rational Mappings First Examples Positive Results Negative Results Computability versus Topological Properties of Julia Sets