Computability and Complexity of Julia Sets

Duration: 54 mins 15 secs

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/1147559/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Braverman, M (Toronto) Wednesday 01 June 2011, 15:15-16:15

Created:

2011-06-03 14:25

Collection:

Discrete Analysis

Publisher:

Isaac Newton Institute

Braverman, M

Language:

eng (English)

Credits:

Author:	Braverman, M
Director:	Steve Greenham


Abstract:	Studying dynamical systems is key to understanding a wide range of phenomena ranging from planetary movement to climate patterns to market dynamics. Various computational and numerical tools have been developed to address specific questions about dynamical systems, such as predicting the weather or planning the trajectory of a satellite. However, the theory of computation behind these problems appears to be very difficult to develop. In fact, little is known about computability of even the most natural problems arising from dynamical systems. In this talk I will survey the recent study of the computational properties of dynamical systems that arise from iterating quadratic polynomials on the complex plane. These give rise to the amazing variety of fractals known as Julia sets, and are closely connected to the Mandelbrot set. Julia sets are perhaps the most drawn objects in Mathematics due to their fascinating fractal structure. The theory behind them is even more fascinating, and the dynamical systems generating them are in many ways archetypal. I will present both positive and negative results on the computability and computational complexity of Julia sets.

Abstract:

Studying dynamical systems is key to understanding a wide range of phenomena ranging from planetary movement to climate patterns to market dynamics. Various computational and numerical tools have been developed to address specific questions about dynamical systems, such as predicting the weather or planning the trajectory of a satellite. However, the theory of computation behind these problems appears to be very difficult to develop. In fact, little is known about computability of even the most natural problems arising from dynamical systems. In this talk I will survey the recent study of the computational properties of dynamical systems that arise from iterating quadratic polynomials on the complex plane. These give rise to the amazing variety of fractals known as Julia sets, and are closely connected to the Mandelbrot set. Julia sets are perhaps the most drawn objects in Mathematics due to their fascinating fractal structure. The theory behind them is even more fascinating, and the dynamical systems generating them are in many ways archetypal. I will present both positive and negative results on the computability and computational complexity of Julia sets.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.84 Mbits/sec	752.35 MB	View	Download
WebM	640x360	1.43 Mbits/sec	582.26 MB	View	Download
Flash Video	484x272	568.73 kbits/sec	225.98 MB	View	Download
iPod Video	480x270	506.24 kbits/sec	201.15 MB	View	Download
MP3	44100 Hz	125.01 kbits/sec	49.48 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)