Omar Leon Sanchez, McMaster University
"Statement of the Main Theorem"
Ian Payne, Pure Mathematics, University of Waterloo
"A result on constraint satisfaction problems: part 3"
In this talk, I will begin going through Bulatov's proof that a nonempty standard $(2,3)$-system with potatoes from a variety of $2$-semilattices has a solution. It should take two lectures to complete the proof.
Rahim Moosa, Pure Mathematics, University of Waterloo
"More on definable functors, and imaginaries"
Mohammad Mahmoud, Pure Mathematics, University of Waterloo
"Algorithmic Randomness: Introduction to Kolmogorov Complexity"
Last time we saw why the Kolmogorov complexity $K$ can be better than the plain complexity $C$ as it is subadditive and complexity doesn't dip. This time we are going to see more properties showing that $K$ matches our intuition. More precisely, (a) Incompressible (in the sense of $K$) strings have only short runs of zeros (i.e. blocks only consisting of zeros), and (b) Zeros and ones occur balancedly.
MC 5403