BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260406T024012Z
UID:5e1830c4ae46c520923952@ist.ac.at
DTSTART:20200116T150000
DTEND:20200116T161500
DESCRIPTION:Speaker: Gemma de las Cuevas\nhosted by Bernat Corominas-Murtra
 \nAbstract: Why is it so easy to generate complexity? Because essentially 
 every non-trivial system is universal\, that is\, capable of exploring all
  complexity in its domain. I will argue that there is universality eveyrwh
 ere and will discuss this concept of universality in two domains: for spin
  models and for automata (or\, equivalently\, formal languages). I will ex
 plain the first step toward linking them rigorously\, by which we describe
  spin hamiltonians as automata. The latter leads to a new complexity measu
 re of hamiltonians\, with a different threshold between easy and hard than
  the computational complexity of the ground state energy problem.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:bcoromin@ist.ac.at
SUMMARY:Gemma de las Cuevas: Universality everywhere: from spin models to a
 utomata
URL:https://talks-calendar.ista.ac.at/events/2490
END:VEVENT
END:VCALENDAR