VCQ Talk by Gemma De las Cuevas (University of Innsbruck)

22.11.2021 17:00 - 18:00

"From simplicity to universality and undecidability" - CHANGES due to the Corona situation

 

CHANGES due to the Corona situation

the colloquium will take place online ONLY via Zoom: https://univienna.zoom.us/j/96023892302?pwd=U00zRHROQmwycjRPemwyQXY0QUt2UT09

 

 

INVITATION TO THE

VCQ COLLOQUIUM TALK

 

GENERAL INFORMATION:

1.       Due to the current Covid-19-situation  all colloquium-talks will be held in presence and online via ZOOM:
https://univienna.zoom.us/j/96023892302?pwd=U00zRHROQmwycjRPemwyQXY0QUt2UT09

2.       As long as the VCQ Colloquium is held in presence you have to attend the lecture in person in order to receive ETCS points.

3.       COVID-Rules at the Atoministitut:
2G (vaccinated or recovered)
In order to provide a fast entry you have to register at the Atoministitut for each Colloquium until 15:00 (3 p.m.) at the latest  with an email to ati.office@tuwien.ac.at with your full name,  email-address and mobile number[Barbara Stros] .

When the access is confirmed, you will receive an automatically generated mail from "TISS".

4.      Please be aware that these rules can change anytime and you will get a short notice before the event.

 

 

The Vienna Center for Quantum Science and Technology (VCQ)
invites you to a

COLLOQUIUM TALK
by

Gemma De las Cuevas

(University of Innsbruck)

From simplicity to universality and undecidability

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, where we cast classical spin Hamiltonians as formal languages and classify the latter in the Chomsky hierarchy. I will also talk about the other side of the coin of universality, namely undecidability, which comes from self-reference and negation as in “I am a liar”. I will propose that there is undecidability everywhere, namely, that essentially every non-trivial question of a system is undecidable. I will also share some thoughts about the reach of universality and undecidability in other disciplines. 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, where we cast classical spin Hamiltonians as formal languages and classify the latter in the Chomsky hierarchy. I will also talk about the other side of the coin of universality, namely undecidability, which comes from self-reference and negation as in “I am a liar”. I will propose that there is undecidability everywhere, namely, that essentially every non-trivial question of a system is undecidable. I will also share some thoughts about the reach of universality and undecidability in other disciplines.

 

 

Monday, 22nd November 2021,

16:45 get-together with coffee and snacks!

Main Lecture Hall at TU Wien, Atominstitut, Stadionallee 2, 1020 Vienna

Host: Markus Müller

 

for further information and the zoom-link please visit vcq.quantum.at/colloquium-ws21-22