GaspardFougea
I'm a PhD student at Laboratoire Methodes Formelles (Ecole Normale Supérieure Paris Saclay, CNRS) under the supervision of Alain Finkel and Stephane Le Roux since 2023.
PhD topic: Formal models for consciousness : from subjective experience towards cognitive algorithms.
Get a quick understanding of my PhD by watching my presentation at the Saclay finale of "Ma thèse en 180 secondes" ("My PhD in 180 seconds") where I won the price of the jury. View the video here.
Contact
For research or teaching purposes, please contact me at gaspard.fougea (at) lmf (dot) cnrs (dot) fr
Research Interest
- Formal models for psychology
- Consciousness studies
- Stress
Seminars and talks:
- Seminar 3 : Mathematical Aspects of Integrated Information Theory (IIT) 2, 06-02-2024, Paris Mathematical Models of Cognition and Consciousness.
- Talk on "Models of consciousness and their implication on the possibility of artificial consciousness", 15-02-2024, AI-PHI club.
- 3rd student poster prize at the 27th annual meeting of the Association for the scientific study of consciousness (ASSC27) on formal models for psychology, 5fth of July 2024, Tokyo. Evaluated over 100 student posters)
- Talk on formal models for psychology at Models of Consciousness 5, 2nd of October 2024, University of Bamberg
Publications:
- Finkel, A.; Fougea, G. and Roux, S. L. (2025). An Automata-Based Method to Formalize Psychological Theories: The Case Study of Lazarus and Folkman’s Stress Theory. In Proceedings of the 13th International Conference on Model-Based Software and Systems Engineering, ISBN 978-989-758-729-0, ISSN 2184-4348, pages 204-215. Click here for the arXiv preprint.
Teaching experience
- Teaching assistant. Automata and lexical analysis, semester-long course to 2nd year at Université Paris-Cité, computer science bachelor. 24h TD, 10h TP on JFLEX. September 2024 - January 2025. Finite automata, rational languages, lexical analysis
- Teaching assistant. Calculability and Decidability, semester-long course to 3rd years at Université Paris-Sorbonne, computer science bachelor. 19.25h TD, 19h TP. January - May 2025. Finite automata, context-free languages, pushdown automata, turing machines