Computation Models – Calculations – Algorithmics and Complexity – Decidability – Formal Languages – Semantics – Verification – Proof – Test.
Team leader 4: Dr. Maarouk Toufik Messaoud
Lines of research
| Team04 |
The first goal of this varied theme is to study the power of classical calculation models (Turing machines, recursive functions, Lambda-Calculation, etc.) and certain non-classical models such as cellular automata and rewriting systems or other models. from physics. One of the most natural questions that arise is the question of computability and decidability, and another fundamental one is whether a computational model is suitable for systems modeling. We then talk about expressiveness. In this context, two privileged areas of investigation are to be studied: algorithms and proof.
