Uploaded April 2025 | Updated September 2026, 3 weeks ago
Topos Institute Colloquium, 17th of April 2025.
———
This presentation describes the two different rules for probabilistic updating, associated with Pearl and with Jeffrey. The difference emerges in the presence of updating with multiple data items that one wishes to learn from (update with). It will be sketched how Jeffrey's rule is used in a classical algorithm in machine learning, namely Expectation Maximisaton.
Topos Institute Colloquium, 17th of April 2025.
———
This presentation describes the two different rules for probabilistic updating, associated with Pearl and with Jeffrey. The difference emerges in the presence of updating with multiple data items that one wishes to learn from (update with). It will be sketched how Jeffrey's rule is used in a classical algorithm in machine learning, namely Expectation Maximisaton.
![[Oxford Seminar] Adrián Puerto Aubel | A glance at Petri net theory](https://i.ytimg.com/vi/z5DXdfV8Fw0/mqdefault.jpg "[Oxford Seminar] Adrián Puerto Aubel | A glance at Petri net theory
Oxford Seminar, February 19 2026
Speaker: Adrián Puerto Aubel
Full Title: A glance at Petri net theory
Abstract: Petri nets are formal models of computing well-known for depicting true concurrency. Unlike automata, they overcome the state-space explosion problem by avoiding interleaving semantics. In this talk I will give an overview of the most prominent theoretical developments of more than 50 years of Petri net theory. This will range from the different expressions of formal semantics of these models as marking graphs, unfoldings, or event structures, to an overview of relevant problems defined on them and their complexities, with a particular focus on structural analysis techniques.")
![[DOTS Lectures] 2. More categories of systems](https://i.ytimg.com/vi/zv10Vgl3Shc/mqdefault.jpg "[DOTS Lectures] 2. More categories of systems
Part of a lecture series on the Double Operadic Theory of Systems (DOTS) presented by David Jaz Myers.")
