Personal profile
Personal profile
Research interests
Education/Academic qualification
HDR (PhD Supervision Credentials)
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
The Domino Problem Is Decidable for Robust Tilesets
Aubrun, N., Blanc, M. & Bournez, O., 1 Jan 2026, Unconventional Computation and Natural Computation - 22nd International Conference, UCNC 2025, Proceedings. Formenti, E. & Manzoni, L. (eds.). Springer Science and Business Media Deutschland GmbH, p. 115-131 17 p. (Lecture Notes in Computer Science; vol. 16364 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Toward higher-order infinite time Turing machines: simulational Γ-machines
Bournez, O., Finkel, O. & Girardot, J., 1 Jul 2026, In: Annals of Pure and Applied Logic. 177, 7, 103741.Research output: Contribution to journal › Article › peer-review
-
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations
Blanc, M. & Bournez, O., 1 Nov 2025, In: International Journal of Foundations of Computer Science. 36, 7, p. 989-1016 28 p.Research output: Contribution to journal › Article › peer-review
-
A Universal Uniform Approximation Theorem for Neural Networks
Bournez, O., Cohen, J. & Wurm, A., 20 Aug 2025, 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025. Gawrychowski, P., Mazowiecki, F. & Skrzypczak, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 345).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Simulation of Turing machines with analytic discrete ODEs: Polynomial–time and space over the reals characterised with discrete ordinary differential equations
Blanc, M. & Bournez, O., 1 Jan 2025, In: Journal of Logic and Analysis. 17, p. 1-42 42 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision
Blanc, M. & Bournez, O., 1 Feb 2024, 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024. Murano, A. & Silva, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 288).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite
Bournez, O. & Gozzi, R., 1 Mar 2024, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Beyersdorff, O., Kante, M. M., Kupferman, O. & Lokshtanov, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 289).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
The Complexity of Computing in Continuous Time: Space Complexity Is Precision
Blanc, M. & Bournez, O., 1 Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 129. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations Simulation of Turing Machines with Analytic Discrete ODEs
Blanc, M. & Bournez, O., 1 Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations
Bournez, O. & Durand, A., 1 Dec 2023, In: Computational Complexity. 32, 2, 7.Research output: Contribution to journal › Article › peer-review