COURSE MPRI 2.11.1 - Molecular Programming br Lecture 24: Universality in tile assembly systems br By: Nicolas SCHABANEL, CNRS (IRIF, U. Paris Diderot) br Parisian Master of Computer Science (MPRI) br br [0:00:00] Simulating Turing Machines at T°=2 br [0:29:02] Kolmogorov Complexity br [0:54:16] Lower Bounding the minimal number of tiles to hardcode the input seed with Kolmogorov C. br [1:06:43] Optimal number of tiles for harcoding the seed br [1:42:54] Exercise session: Assembly time = O(rank) w.h.p.