Computability Learning Seminar
Mohammad Mahmoud, Pure Mathematics, University of Waterloo
"Algorithmic Randomness: Introduction to Kolmogorov Complexity"
Mohammad Mahmoud, Pure Mathematics, University of Waterloo
"Algorithmic Randomness: Introduction to Kolmogorov Complexity"
Raymond Cheng, Department of Pure Mathematics, University of Waterloo
"Hodge Decomposition and Kahler Manifolds"
Javad Mashreghi, Laval University
"The Halmos Conjecture on the Numerical Range"
Ehsaan Hossain, Department of Pure Mathematics University of Waterloo
“Prime and semiprime rings”
Anton Mosunov, Department of Pure Mathematics, University of Waterloo
“Modular Curves and Moduli Spaces”
Kiumars Kaveh, University of Pittsburgh
“Lattice points, convex bodies and algebraic geometry”
Jonathan Stephenson, Department of Pure Mathematics, University of Waterloo
“Martin-Lf Randomness”
We will continue last week’s discussion of prefix-free Kolmogorov complexity, but will begin to focus more on infinite sequences. We will discuss what we might mean when we say that an infinite sequence looks random from an algorithmic perspective.
Raymond Cheng, Department of Pure Mathematics, University of Waterloo
“Hodge and Lefschetz Decompositions”
Jason Crann, Department of Pure Math, University of Waterloo
“Homological manifestations of quantum group amenability”
Anton Borissov, Department of Pure Mathematics, University of Waterloo
“The Klein-Gordon Field”