Isbn: 9783540685463 - computability of julia sets: 23 (algorithms and computation in mathematics, 23) (17 resultados)

Condición: New.

Hardback or Cased Book. Condición: New. Computability of Julia Sets. Book.

Condición: New.

Hardcover. Condición: Wie neu. XIII, 151 S.; Ill. Like new. Shrink wrapped. Sprache: Deutsch Gewicht in Gramm: 525.

Condición: New. In English.

hardcover. Condición: very good. no jacket. Nearly new.

Condición: New. pp. 168.

Condición: New.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 151 pp. Englisch.…

Condición: New. Print on Demand pp. 168 31 Illus. This item is printed on demand.

Condición: New. PRINT ON DEMAND pp. 168.

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first book describing in detail some spectacular results on computation and complex dynamical systems. M. Braverman is an expert in Theoretical Computer Science, particularly in applications of computability to Complex Analysis and Dynamical Syst. …