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,...
Wedi'i Gadw mewn:
| Prif Awduron: | Braverman, Mark, Ph. D., Yampolsky, Michael, 1972- (Awdur) |
|---|---|
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Rhifyn: | 1st ed. 2009. |
| Cyfres: | Algorithms and Computation in Mathematics
23 |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
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 |
Eitemau Tebyg
-
Computability
(Livre papier)
Tourlakis, George J., 1946-
Reston Pub. Co., 1984 -
Computability
(Livre papier)
Weihrauch, Klaus, 1943-
Springer-Verlag, 1987 -
Automata and computability
(Livre papier)
Kozen, Dexter C., 1951-
Springer, 1997 -
Computability and logic
(Livre papier)
Boolos, George, 1940-1996, et al.
University Press, 1974 -
Computability and unsolvability
(Livre papier)
Davis, Martin, 1928-2023
McGraw-Hill, 1958

