Computability of Julia Sets [electronic resource] / by Mark Braverman, Michael Yampolsky.

By: Braverman, Mark [author.]
Contributor(s): Yampolsky, Michael [author.] | SpringerLink (Online service)
Material type: TextTextSeries: Algorithms and Computation in Mathematics: 23Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009Description: XIII, 151 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540685470Subject(s): Mathematics | Computer programming | Computers | Algorithms | Computer science -- Mathematics | Algebra | Mathematics | Algorithms | Algebra | Programming Techniques | Theory of Computation | Algorithm Analysis and Problem Complexity | Mathematics of ComputingAdditional physical formats: Printed edition:: No titleDDC classification: 518.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Contents:
to Computability -- Dynamics of Rational Mappings -- First Examples -- Positive Results -- Negative Results -- Computability versus Topological Properties of Julia Sets.
In: Springer eBooksSummary: 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 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

to Computability -- Dynamics of Rational Mappings -- First Examples -- Positive Results -- Negative Results -- Computability versus Topological Properties 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, 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 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.

There are no comments for this item.

to post a comment.

Powered by Koha