From simplicity to universality and undecidability
DIPC Seminars
- Speaker
-
Gemma De las Cuevas, University of Innsbruck, Austria
- When
-
2021/10/15
14:00 - Place
- Online Seminar, Donostia International Physics Center
- Add to calendar
-
iCal
Why is it so easy to generate complexity? I will suggest that this is due to
the phenomenon of universality — essentially every non-trivial system is
universal, and thus able to explore all complexity in its domain. We
understand universality in spin models, automata and neural networks. I will
present the first step toward rigorously linking the first two, which will
leads to a comparison between the grammar of machines and the grammar of spin
models. I will also present some thoughts on extending these ideas to
linguistics, and talk about the other side of the coin of universality:
undecidability.
Host: Roman Orus
ZOOM: