Click & Collect
from 2 Hours*
Last Christmas
delivery dates
Free UK Standard Delivery On all orders over £25 Order in time for Christmas 19th December 2nd Class |
21st December by 3pm 1st Class
Free Click & Collect to shops From 2 hours after you order*
Computability of Julia Sets - Algorithms and Computation in Mathematics 23 (Hardback)
  • Computability of Julia Sets - Algorithms and Computation in Mathematics 23 (Hardback)

Computability of Julia Sets - Algorithms and Computation in Mathematics 23 (Hardback)

(author), (author)
Hardback 151 Pages / Published: 26/11/2008
  • We can order this from the publisher

UK delivery within 3-4 weeks

  • This item has been added to your basket

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.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783540685463
Number of pages: 151
Weight: 920 g
Dimensions: 235 x 155 x 11 mm
Edition: 2009 ed.


From the reviews:

"The study of dynamical systems has at its core ... a very computational feel. ... One can feel the book trying to be self-contained ... . The subject of the book is timely and important. ... The questions posed and answered in the present book are natural and the approach well-suited to produce enlightening results. ... The book is also generous ... . It has the potential to inspire considerable future work in this intriguing field." (Wesley Calvert, SIGACT News, Vol. 41 (1), 2010)

"Written in an accessible way with many explications, examples and illustrations. ... this book sees the meeting of two worlds: computability theory and iteration of rational maps. It is a fruitful one ... and a share of surprises. It is also a compendium of several years of research by the authors ... together with a lot of new results. ... a nice and quick introduction to both topics, and much of it is pleasant to read ... . includes interesting discussions and presents stimulating conjectures." (Arnaud Cheritat, Foundations of Computational Mathematics, Vol. 12, 2012)

You may also be interested in...

Surreal Numbers
Added to basket
Book of Abstract Algebra
Added to basket
Matrices and Linear Algebra
Added to basket
The Cartoon Guide to Algebra
Added to basket
Introduction to Graph Theory
Added to basket
Maths for Science
Added to basket
Schaum's Outline of Matrix Operations
Added to basket
Elliptic Tales
Added to basket
Added to basket
Linear Algebra For Dummies
Added to basket
Interest Rate Modeling. Volume 3
Added to basket
Basic Algebra I
Added to basket
Linear Algebra: Concepts and Methods
Added to basket
Edexcel Award in Algebra Level 3 Workbook
Added to basket

Please sign in to write a review

Your review has been submitted successfully.