Invited Seminars Thematic month The five weeks |
## Dynamics And Computation
## 1. DatesFrom February 8 to February 12, 2010. ## 2. Description of the weekComputer simulations of a dynamical system may help better understand its behavior, and some new conjectures may thus arise. Scientists are then confronted with the problem of simulating continuous dynamical systems, which leads to computability questions on real numbers. For example, which invariants (e.g. entropy) of continuous dynamical systems are computable? In this week, computability theory and effective simulation will be seen as tools for the study of dynamical systems. ## 3. Abstracts of the morning lectures (4h30 each)- Olivier Bournez: Analog Models of Computations
- Péter Gács: Reliable computation with cellular automata
- Mike Hochman: Recursion theory, computation and {{$\mathbb{Z}^d$}} actions on Cantor space
## 4. Schedule of the morning lectures
## 5. Proposed workshops (add your suggestions here)- C. Bonanno. Entropy and PDE.
- A. Goetz."Piecewise isometries". See http://stream.sfsu.edu/tem/hnotices
- Mathieu Hoyrup and Cristobal Rojas: "Computability in ergodic theorems"
- Petr Kurka: "Exact real arithmetic based on Moebius number systems" Moebius number systems generalize both positional and continued fraction systems. Real numbers are represented by sequences of Moebius transformations. If the system is redundant, efficient algorithms for exact real arithmetic exist.
- S. Simpson: "Medvedev and Muchnik degrees of subshifts".
- P. Collins: "Computable Analysis and Nonlinear Dynamics"
## 6. General Schedule (will be updated every night)**Monday 8th****9h00-10h30**: Péter Gács -*Reliable computation with cellular automata I.***11h00-12h30**: Olivier Bournez -*Analog Models of Computations I.***14h45-15h00**: Workshop organization.**15h00-16h30**: Cristobal Rojas and Mathieu Hoyrup -*Computability in ergodic theorems*.**17h00-18h00**: Cristobal Rojas and Mathieu Hoyrup -*Back to basics in ergodic theory.***18h00-19h30**: Apéritif at IML.
**Tuesday 9th****9h00-10h30**: Olivier Bournez -*Analog Models of Computations II.***11h00-12h30**: Péter Gács -*Reliable computation with cellular automata II.***15h15-16h15**: L. Bienvenu -*Introduction to Algorithmic Randomness and Kolmogorov Complexity*-
**16h30-17h30**: Two parallel sessions:- B. Schratzberger -
*Singularisation of continued fraction algorithms (relocation of Ernest seminar at Chapelle)* - C. Rojas -
*Computability of Invariant Measures*
- B. Schratzberger -
**18h00-19h00**: C. Bonanno -*Applications of Kolmogorov complexity to dynamical systems*
**Wednesday 10th****9h00-10h30**: Péter Gács -*Reliable computation with cellular automata III.***11h00-12h30**: Olivier Bournez -*Analog Models of Computations III.***16h15-17h15**: proposed by A. Shen / suggested speakers P. Gacs, M. Hoyrup, C. Rojas -*Randomness in general spaces and uniform tests of randomness.***17h30-18h30**: F. Blanchard -*Chaos: stronger definitions of the butterfly effect (sensitivity)***18h30-19h30**: Petr Kurka -*Möbius number system*
**Thursday 11th****9h00-9h50**: P. Collins -*Computable analysis and nonlinear dynamics: Introductory talk.***10h00-10h50**: A. Goetz -*Piecewise isometries - two dimensional generalizations of interval exchanges: Introductory talk.***11h30-12h30 : Two parallel sessions**- P. Collins -
*Computable analysis and nonlinear dynamics: Informal discussions.* - A. Goetz -
*Piecewise isometries - two dimensional generalizations of interval exchanges: Informal discussions.*
- P. Collins -
**14h30-15h30**: S. Capobianco -*Enforcing reversibility in cellular automata*or*Computer without batteries? Rewriting cellular automata as block automata*or both**16h00-18h00**: M. Hochman -*Recursion theory, computation and Z*Live from Princeton.^{d}actions on Cantor space I.
**Friday 12th****9h00-10h30**: S. Simpson -*Mass problem, Medvedev degrees, Muchnik degrees, applied to symbolic dynamics*.**10h45-12h15**: Mike Hochman -*Recursion theory, computation and Z*Live from Princeton.^{d}actions on Cantor space II.**14h-15h**: C. Jadur and J. Yazlle -*Finite codes in cellular automata*.**15h30-17h**A. Shen -*Every one dimensional effectively closed subshift is a projection of two dimensional finite type subshift*.
## 7. Currently uploaded slides- ArekGoetz-TheDynamicsAndGeometryOfMicroscopicStructuresInPiecewiseRotations.pdf ... 4,825,791 bytes ... 11 February 2010 à 10h56
- ChristobalRojas-MathieuHoyrup-ComputabilityInErgodicTheorems.pdf ... 610,961 bytes ... 09 February 2010 à 01h10
- JorgeYazlleCamiloJadur-FiniteCodesInCellularAutomata.pdf ... 1,260,238 bytes ... 07 March 2010 à 00h19
- LaurentBienvenu-AnIntroductionToKolmogorovComplexity.pdf ... 1,730,041 bytes ... 10 February 2010 à 22h24
- MichaelHochman-RecursionTheoryAndDynamics-I-ShiftsOfFiniteType.pdf ... 6,840,262 bytes ... 11 February 2010 à 18h01
- MichaelHochman-RecursionTheoryAndDynamics-II-ApproximationOfActionsOnTheCantorSet.pdf ... 1,578,673 bytes ... 14 February 2010 à 22h29
- OlivierBournez-DynamicsAndComputationI.pdf ... 1,130,481 bytes ... 09 February 2010 à 15h47
- OlivierBournez-DynamicsAndComputationII.pdf ... 3,300,277 bytes ... 09 February 2010 à 15h47
- OlivierBournez-DynamicsAndComputationIII.pdf ... 1,093,929 bytes ... 11 February 2010 à 00h18
- PeterGacs-ReliablyComputingCellularAutomatonIn3Dimensions-I-ToomTalk.pdf ... 1,049,516 bytes ... 09 February 2010 à 00h22
- PeterGacs-ReliablyComputingCellularAutomatonIn3Dimensions-II-In1SparseNoise.pdf ... 410,375 bytes ... 09 February 2010 à 18h54
- PetrKurka-MoebiusNumberSystems.pdf ... 1,225,691 bytes ... 10 February 2010 à 22h24
- PieterCollins-ComputableAnalysisAndNonlinearDynamics.pdf ... 1,461,692 bytes ... 11 February 2010 à 09h24
- SilvioCapobianco-ComputersWithoutBatteries.pdf ... 700,533 bytes ... 17 February 2010 à 23h10
- StephenSimpson-DegreesOfUnsolvabilityAndSymbolicDynamics.pdf ... 108,874 bytes ... 12 February 2010 à 09h13
## 8. ParticipantsSee the page Dynamics And Computation Participants |

For any technical question or comment regarding this wiki, you can contact the wemaster.