Computability of Julia Sets

• Κύριοι συγγραφείς: Braverman, Mark (Συγγραφέας), Yampolsky, Michael (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Σειρά: Algorithms and Computation in Mathematics, 23
• Θέματα: Mathematics.; Computer programming.; Computers.; Algorithms.; Computer science > Mathematics.; Algebra.; Programming Techniques.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Mathematics of Computing.

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,...