Computability and Complexity in Analysis and Dynamics Seminar

 

The seminar ran between 2004 and 2006. It is not currently active.
The goal of the seminar is to discuss the questions of algorithmic computability and complexity of computations which arise in analytic problems. We hope to keep the discussions informal, with both local and outside speakers. The talk are mostly accessible to general cs/math audience.
To join the mailing list of the seminar please email to ####-request @cs.toronto.edu, replacing the #### by ccad.

Recent topics

Date Topic Presented by
03/03/2006   On Newton's Method for Polynomials in One Variable: Conformal Dynamics meets Complexity Dierk Schleicher,
International University of Bremen
10/02/2006   Kolmogorov complexity and some of its applications to geometry Alex Nabutovsky,
University of Toronto
03/02/2006   Good starting points for solving systems of polynomial equations and Smale's 17th Problem Michael Shub,
University of Toronto
27/01/2006   Computing p-adic integrals Julia Gordon,
University of Toronto
25/11/2005   Computational complexity of Julia sets Michael Yampolsky,
University of Toronto
02/11/2005   Computation on metric algebras Jeffery Zucker,
McMaster University
28/10/2005   A computer-assisted proof of a fixed point theorem in dynamics Hans Koch,
University of Texas, Austin
14/10/2005   Topological Complexity of Zero Finding for Continuous Functions Peter Hertling,
Universitat der Bundeswehr Munchen
07/10/2005   Dynamics of a piecewise affine homeomorphism of the torus Robert MacKay,
University of Warwick
30/09/2005   Introduction to real computation Mark Braverman,
University of Toronto
01/04/2005   On the complexity of conformal maps Ilia Binder,
University of Toronto
04/03/2005   What are pseudo-random generators and how can we construct them? Charles Rackoff,
University of Toronto
25/02/2005   Well-posedness and Computability of Differential Equations Ning Zhong,
University of Cincinnati
04/02/2005   Estimating the volume of convex bodies efficiently Avner Magen,
University of Toronto
28/01/2005  What is universality in dynamics, and how to prove it exists (with the help of a computer) Denis Gaidashev,
University of Toronto
21/01/2005  Quantum Computer Algorithms
 Michele Mosca,
University of Waterloo
14/01/2005  Computing over the Reals (Complex Numbers and Integers) and Complexity
 Michael Shub,
University of Toronto
03/12/2004 Set computability in two models: the bit and the BSS model.
Mark Braverman,
University of Toronto
19/11/2004  Introduction to computer-assisted proofs. Denis Gaidashev,
University of Toronto
12/11/2004  Computability of Julia sets
 Michael Yampolsky,
University of Toronto
05/11/2004  Introduction to real computation theory. Mark Braverman,
University of Toronto