Computability, Analysis, and Geometry
Videos from BIRS Workshop
Marc Lackenby, University of Oxford
Monday Mar 9, 2015 09:04 - 09:53
The complexity of knots
Nathan Dunfield, University of Illinois at Urbana-Champaign
Monday Mar 9, 2015 10:01 - 10:40
Computational complexity of problems in 3-dimensional topology
Mark Sapir, Vanderbilt University
Monday Mar 9, 2015 10:59 - 11:50
Groups and machines
Saugata Basu, Purdue University
Monday Mar 9, 2015 14:17 - 15:03
A complexity theory of constructible functions and sheaves
Igor Pak, University of California Los Angeles
Monday Mar 9, 2015 15:31 - 16:27
Words in linear groups, random walks, automata and P-recursiveness
Denis Hirschfeldt, University of Chicago
Tuesday Mar 10, 2015 09:03 - 09:51
Five and a Half Approaches to Algorithmic Randomness
Cristóbal Rojas, Universidad Católica de Chile
Tuesday Mar 10, 2015 09:59 - 10:39
Algorithmic ergodic theory and randomness
Jeremy Avigad, Carnegie Mellon University
Tuesday Mar 10, 2015 10:51 - 11:36
Computability and uniformity in ergodic theory
Steffen Rohde, University of Washington
Wednesday Mar 11, 2015 09:02 - 09:49
How to draw trees
Ilia Binder, University of Toronto
Wednesday Mar 11, 2015 09:57 - 10:39
Computability properties of conformal maps
Nikita Selinger, Stony Brook University
Wednesday Mar 11, 2015 10:55 - 11:35
Combinatorial equivalence of Thurston maps
Alexander Nabutovsky, University of Toronto
Thursday Mar 12, 2015 09:02 - 09:54
Finite presentations of Z and the trivial group and applications to four-dimensional geometry
Volodymyr Nekrashevych, Texas A & M University
Thursday Mar 12, 2015 10:06 - 10:54
Topological conjugacy of expanding maps
Ankit Garg, Microsoft Research
Thursday Mar 12, 2015 11:05 - 11:40
Information complexity and communication complexity
