Computability of Julia sets / Mark Braverman, Michael Yampolsky

Auteur principal : Braverman, Mark, AuteurCo-auteur : Yampolsky, Michael, 1972-, AuteurType de document : MonographieCollection : Algorithms and computation in mathematics, 23Langue : anglais.Pays: Allemagne.Éditeur : Berlin : Springer, 2009Description : 1 vol. (XIII-151 p.) : fig. ; 25 cmISBN: 9783540685463.ISSN: 1431-1550.Bibliographie : Bibliogr. p. 146-148. Index..Sujet MSC : 03-01, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations
03D15, Computability and recursion theory, Complexity of computation (including implicit computational complexity)
03D80, Applications of computability and recursion theory
37F50, Dynamical systems over complex numbers, Small divisors, rotation domains and linearization in holomorphic dynamics
37P40, Arithmetic and non-Archimedean dynamical systems, Non-Archimedean Fatou and Julia setsEn-ligne : Springerlink
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode
Monographie Monographie CMI
Salle 1 		03 BRA (Browse shelf(Opens below)) Available 06915-01

Bibliogr. p. 146-148. Index.

There are no comments on this title.

to post a comment.