72 min listen
Strachey lecture - Symmetry and Similarity
FromComputer Science
ratings:
Length:
61 minutes
Released:
Feb 16, 2023
Format:
Podcast episode
Description
An introduction to algorithmic aspects of symmetry and similarity, ranging from the fundamental complexity theoretic "Graph Isomorphism Problem" to applications in optimisation and machine learning Symmetry is a fundamental concept in mathematics, science and engineering, and beyond. Understanding symmetries is often crucial for understanding structures. In computer science, we are mainly interested in the symmetries of combinatorial structures. Computing the symmetries of such a structure is essentially the same as deciding whether two structures are the same ("isomorphic"). Algorithmically, this is a difficult task that has received a lot of attention since the early days of computing. It is a major open problem in theoretical computer science to determine the precise computational complexity of this "Graph Isomorphism Problem".
Released:
Feb 16, 2023
Format:
Podcast episode
Titles in the series (24)
Strachey Lecture - Quantum Supremacy: Dr Scott Aaronson (MIT, UT Austin) gives the 2016 Strachey lecture. by Computer Science