UC San Diego Product Management Certificate — AI-Powered PM Training
NY State-Licensed Certificates in Design, Coding & AI — Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
Syllabus
Introduction
Defining computads
adjoint
codiagonal
zero computabs
computax
hyper
one computabs
Shulmans PTT
Zitarata
Onedimensional fragment
Activeness wiring diagrams
Shulmans theorem
Modification of Shulmans theorem
Syntax of Shulmans theorem
Conditionals in Markov categories
Categorical abstraction
Probabilistic processes
Taught by
Topos Institute