[2017 MPRI 2.11.1] Molecular programming 2/4 (25 OCT)
COURSE MPRI 2.11.1 - Molecular Programming Lecture 2/4: Universality in tile assembly systems By: Nicolas SCHABANEL, CNRS (IRIF, U. Paris Diderot) Parisian M...
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Thailand under the topic 'สภาพอากาศ'.
About this video
COURSE MPRI 2.11.1 - Molecular Programming
Lecture 2/4: Universality in tile assembly systems
By: Nicolas SCHABANEL, CNRS (IRIF, U. Paris Diderot)
Parisian Master of Computer Science (MPRI)
[0:00:00] Simulating Turing Machines at T°=2
[0:29:02] Kolmogorov Complexity
[0:54:16] Lower Bounding the minimal number of tiles to hardcode the input seed with Kolmogorov C.
[1:06:43] Optimal number of tiles for harcoding the seed
[1:42:54] Exercise session: Assembly time = O(rank) w.h.p.
Lecture 2/4: Universality in tile assembly systems
By: Nicolas SCHABANEL, CNRS (IRIF, U. Paris Diderot)
Parisian Master of Computer Science (MPRI)
[0:00:00] Simulating Turing Machines at T°=2
[0:29:02] Kolmogorov Complexity
[0:54:16] Lower Bounding the minimal number of tiles to hardcode the input seed with Kolmogorov C.
[1:06:43] Optimal number of tiles for harcoding the seed
[1:42:54] Exercise session: Assembly time = O(rank) w.h.p.
Video Information
Views
16
Total views since publication
Duration
02:39:19
Video length
Published
Oct 27, 2017
Release date