Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a detailed seminar presentation from the Topos Institute Berkeley series that delves into type systems for probabilistic conformational molecular computing. Learn about computads, Shulman's PTT (Polynomial Tree Theory), and their variations for semicartesian and Markov categories. Gain insights into one-dimensional fragments, activeness wiring diagrams, categorical abstraction, and probabilistic processes. Discover how conditional structures operate within Markov categories and understand the theoretical foundations that bridge computational abstractions with molecular computing applications. The presentation covers advanced mathematical concepts including adjoint codiagonal, zero computabs, computax, and hyperone computabs while examining Shulman's theorem and its modifications.
