My research revolves around symbolic systems, especially symbolic dynamics (and more particularly cellular automata). It generally involves computability theory (on the computer science side) and/or probabilities and ergodic theory (on the mathematics side).

My research topics can be roughly classified into two parts:

• Computability in dynamical systems, the interaction of dynamics and the ability to perform computation, and the difficulty to compute dynamical objects;
• Discrete probabilities in dynamical systems, especially related to self-organisation phenomena, often involving interacting particle systems.

Ph.D. thesis

I did my Ph.D., titled Asymptotic behaviour of Cellular Automata: Computation and Randomness, under the supervision of Xavier Bressaud and Mathieu Sablik at the Aix-Marseille University. The thesis defense took place in Marseille on the September 26th, 2014. Here is the manuscript.

Publications

Journals

With Mathieu Sablik: Self-organisation in cellular automata with coalescent particles : Qualitative and quantitative approaches. Accepted to Journal of Statistical Physics, 2016 [arXiv, preprint, preprint, bibtex]

With Martin Delacourt: Characterisation of limit measure of higher-dimensional cellular automata. Accepted to Theory of Computing Systems, 2016 [arXiv, preprint, bibtex]

With Mathieu Sablik: Characterization of sets of limit measures of a cellular automaton iterated on a random configuration. Ergodic Theory and Dynamical Systems, 2016 [link, arXiv, preprint, bibtex]

Conferences

With Martin Delacourt: Construction of μ-limit sets of two-dimensional cellular automata. STACS 2015 [link, preprint, bibtex]

With Mathieu Sablik: Entry times in cellular automata with simple defects dynamics. Automata/JAC 2012 [link, arXiv, preprint, bibtex]

With Mathieu Sablik: Self-organization in cellular automata: a particle-based approach. DLT 2011 [link, preprint, bibtex]

With Takeaki Uno: Maximal matching and path matching counting in polynomial time for graphs of bounded clique width. TAMC 2011 [link, preprint, bibtex]

Submitted

With [Anah\'i Gajardo] (http://www2.udec.cl/~angajardo/), Diego Maldonado et Andrés Moreira: Nontrivial Turmites are Turing-universal. Submitted to Theoretical Computer Science, 2016 [preprint]

Submitted

Curriculum

• sept. 2014 - current: Post-doctorate under the direction of Cristobal Rojas, Universidad Andrés Bello (Santiago).
• sept. 2011 - sept. 2014: Ph.D. in informatics: Asymptotic behaviour of cellular automata: computation and randomness.
• june 2011: Agrégation in mathematics, option informatics (36th). This is a competitive exam for high-school teaching.
• march 2011: Master's degree in Theoretical computer science, ENS Lyon.
• march 2010 - june 2010: internship under the supervision of Mathieu Sablik (LATP, Marseille): Self-organization in cellular automata.
• may 2009 - july 2009: internship under the supervision of Takeaki Uno (NII, Tokyo): Counting matchings in graphs of bounded clique-width.
• may 2008 - june 2008: internship under the supervision of Yannis Manoussakis (Orsay): Edge-colored notions of connexity.

Teaching

• 2015 :
  • Vectorial Calculus, 70 hours of lectures in Spanish
• 2014 :
  • Introduction to Computer Science, 40 hours of lectures and tutorials
  • Computer Architecture, 24 hours of lab work
• 2013 :
  • Introduction to Computer Science, 64 hours of lectures, tutorials and lab work
• 2012 :
  • Probabilities, 24 hours of tutorials
  • Mathematics for Computer Science, 40 hours of tutorials and lab work

Miscellaneous

I am a fervent go player. You can meet me at one of the various clubs in Santiago (ICO, Tengen) or on KGS (Jhyn).

Recently I have been listening to a lot of music. I owe a lot to Emmanuel Jeandel who in particular introduced me to rateyourmusic.

Some webcomics : XKCD the greatest, Subnormality with too many words, A softer world the poetic, SMBC the procrastination-enhancing drug.