We discuss (at least) two open problems in computing and physics involving category-theoretic techniques. In the first, we propose to model computational concurrency by constructing the pushout of two symmetric monoidal categories, which involves formalizing a notion of "n-colored" diagrammatic calculi. In the second, we introduce a characterization of the Shannon entropy of a probability measure on a finite set in terms of certain nice functors, and propose to extend this characterization to the countably infinite setting. Working on either one could serve as a nice problem-based introduction to applied category theory for anyone sufficiently motivated.

Pizza and drinks will be served after the seminar in ATL 2117.