Research
I defended my PhD "From algorithmics to logics through
infinite time computation" in December 2016 in
Montpellier in
the LIRMM
laboratory. I mainly worked on the structure of gaps in
the clockable ordinals of infinite time Turing machines
and their links with admissible ordinals.
I'm interested in links between theoretical computer science and logic.
Key words:
- computation models, Turing machines
- infinite time, ordinals
- admissibility, constructible hierarchy
- Turing degrees
Publications:
- [Accepted for Computability in Europe 2017: Unveiling Dynamics and Complexity] Merlin Carl, Bruno Durand, Grégory Lafitte and Sabrina Ouazzani, Admissibles in gaps
- [PhD defended in December 2016] From algorithmics to logics through infinite
time computation.
For more information about infinite time computability:
Talks
Work:
- A brief story of gaps in the infinite time
Turing machines. Bristol Logic Seminar,
University of Bristol (England), May 17
- A mixture of computability and ordinals, the
infinite time Turing machines. Konstanz Women in
Mathematics (KWIM) Lectures Series, Konstanz University
(Germany), April 17
- Let's compute through infinite time! MC2
team seminar LIP ENS Lyon, CANA team seminar LIF
Aix-Marseille University, LACL laboratory seminar
Paris-Est Créteil University, Jan 17 -- CRIL laboratory
seminar Artois University (Lens), Feb 17 -- LIFO
laboratory, Computabilites Days and New Words of
Computation workshops (Orléans), April 17
- Some ordinal time algorithmics, Computabilities days, Nice, April 16
- Ordinal time computation: a presentation, School of the GDR IM, Strasbourg, April 16
- Introduction aux machines de Turing à temps infini , Algebra and Topology seminar, IMAG, Montpellier, September 2015
- Temps de non calcul des machines de Turing à temps infini, Eco-Escape seminar, Lirmm, Montpellier, June 2015
Science popularization (for non computer scientists):
- Poster Machines de Turing à temps infini, Doctiss
(PhD students conference of the I2S Graduate school),
Montpellier, June 2015
- Introduction aux machines de Turing à temps infini, Semindoc (PhD students seminar), Lirmm, Montpellier, May 15
Teaching
In the Paris-Est Créteil University (upec),
2016-2017:
- Discrete Mathematics, lectures-tutorials, Sénart IUT
- Linear Algebra, lectures-tutorials, Sénart IUT
- Analysis, lectures-tutorials, Sénart IUT
- Databases, lectures-tutorials-practical work, Sénart IUT
In the Montpellier University (UM, former UM2),
2015-2016:
- Graph algorithms, tutorials/practical work(C++) L3 UM
- Information systems and databases, tutorials/practical work(Oracle) L2 UM
2014-2015:
2013-2014:
- Logic (basic concepts), tutorials/practical work(Ocaml), L2 UM2
- Algorithmic and data structures, tutorials/practical work(C) L2 UM2
(tutorial exam )
2012-2013:
- Basic concepts in computer science (C2I), practical work L1 UM2
2013-2015, replacements:
- Computation models, tutorials L1 UM2
- Algorithmic information theory, tutorials M1 UM2
- Computability, tutorials M1 UM2
Organisation/Supervision
Supervision
June-July 2015: Internship supervision of Guilhem Marion, L2 (discovering of computability)
Nov-Dec 2014: Supervision of the organisation of the
doctors/PhD students meeting of the "école doctorale
I2S"
Organisation of scientific events
2014-2015: Organisation of
the
PhD students workshop of the Lirmm, where PhD students present their work, and semidocti days, bi-annual fun and science popularization days for everybody
April 2014: Organisation of the Computability days 2014
Offices
Dec 2014-Feb 2016: Elected in the PhD students council
of the Lirmm. Head of the council from May 2015 to Feb
2016. The aim of the council is to provide support, mediation
and prevention in all problems the PhD students can encounter in
their workplace, bring forward their needs to the
direction, and animate the social student life of the
lab. Contact: conseil-doctorants ( at ) lirmm.fr. Tricks
for the daily life of a
lirmmian: Lirmm's
wiki.
Nov 2014-Mar 2016: Representant of computer science PhD students in the "école
doctorale I2S"