BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8396@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20140415T110000
DTEND;TZID=Europe/Paris:20140415T120000
DTSTAMP:20241120T210400Z
URL:https://www.i2m.univ-amu.fr/evenements/ensembles-limites-d-automates-c
 ellulaires-associes-a-une-mesure-de-probabilite/
SUMMARY:Martin Delacourt (Universidad de Chile): Ensembles limites d'automa
 tes cellulaires associés à une mesure de probabilité
DESCRIPTION:Martin Delacourt: Limit sets of cellular automata associated wi
 th a probability measure\nμ-Limit Sets of Cellular Automata from a Comput
 ational Complexity Perspective\nThis talk concerns 𝜇-limit sets of cell
 ular automata: sets of configurations made of words whose probability to a
 ppear does not vanish with time\, starting from an initial 𝜇-random con
 figuration. More precisely\, we investigate the computational complexity o
 f these sets and of related decision problems. Main results: first\, 𝜇-
 limit sets can have a Σ03-hard language\, second\, they can contain only 
 𝛼-complex configurations\, third\, any non-trivial property concerning 
 them is at least Π03-hard. We prove complexity upper bounds\, study restr
 ictions of these questions to particular classes of CA\, and different typ
 es of (non-)convergence of the measure of a word during the evolution.\nht
 tps://hal.archives-ouvertes.fr/hal-00866094v2/\n\nSéminaire IMDB du LIF :
  http://www.lif.univ-mrs.fr/evenements/id/76
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Martin_Delacourt.jpg
CATEGORIES:Séminaire,Ernest
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20140330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR