Events

Date: 18 October 2024   Time: 15:00 - 17:00

Location: Peter Landin 4.24

A sequence of introductory talks

Marc Roth will give a talk as described below:
I will give a brief introduction to the space of graph motif parameters, a vector space of counting problems (such as counting k-cliques in an n-vertex graph) that exhibit very close connections between fine-grained complexity theory, descriptive complexity theory, and the expressive power of graph neural networks.
I will demonstrate the power of this framework using a concrete running example: Counting 3-matchings (sets of 3 pairwise disjoint edges) in n-vertex graphs.

Pasquale Malacaria will give a talk about some very nice short proofs of some fundamental theorems of logic using Kolmogoroff complexity

The seminar will be followed by a social event at which all are welcome.