Inicio > > Ciencias de la computación > Computability of Julia Sets
Computability of Julia Sets

Computability of Julia Sets

Mark Braverman / Michael Yampolsky

65,52 €
IVA incluido
Consulta disponibilidad
Editorial:
Springer Nature B.V.
Año de edición:
2008
Materia
Ciencias de la computación
ISBN:
9783540685463

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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 (most of it from the authors’ own work) 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.

Artículos relacionados

Otros libros del autor

  • Computability of Julia Sets
    Mark Braverman / Michael Yampolsky
    to Computability.- Dynamics of Rational Mappings.- First Examples.- Positive Results.- Negative Results.- Computability versus Topological Properties of Julia Sets. ...
    Disponible

    134,50 €