Publications
Themes
I'm interested in links between Computability and Logic
but also in the application of these links to other fields of
Mathematics and Computer science.
Key words:
- Computation models, Turing machines
- Ordinals
- Transfinite Computations
- Admissibility, Constructible hierarchy
- Turing degrees
- Computations with ordinary differential equations
- (Cheap) Non-Standard Analysis and Computability
For more information about infinite time computability:
International peer-reviewed conferences, article
proceedings
- [Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2018] Olivier Bournez and Sabrina Ouazzani, Cheap Non-standard Analysis and Computability: Some applications
- [Lecture Notes in Computer Science, Proceedings of
the Computability in Europe 2018] Merlin Carl, Sabrina Ouazzani and Philip Welch, Taming Koepke's zoo.
- [Lecture Notes in Computer Science, Proceedings of
the Computability in Europe 2017] Merlin Carl, Bruno
Durand, Grégory Lafitte and Sabrina
Ouazzani, Admissibles in gaps.
International peer-reviewed workshops, abstracts
proceedings
- [Continuity, Computability, Constructivity 2018] Olivier Bournez and Sabrina Ouazzani, Cheap non-standard analysis & Computability.
- [Logic Colloquium 2018] Olivier Bournez and Sabrina Ouazzani, Computability and cheap non-standard analysis.
- [Scandinavian logic symposium 2018 ] Olivier Bournez and Sabrina Ouazzani Computing to the infinite with Ordinary Differential
Equations
Research reports
Thesis
- [PhD defended in December 2016] From algorithmics to logics through infinite
time computation., 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.
Teaching
In the Paris-Est
Créteil University (upec), 384h
2016-2018:
- 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), 235,5h
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