Rewriting Logic and Probabilities. - Olivier Bournez; Mathieu Hoyrup (RTA, 2003)

An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (CoRR, 2007)

Dynamical systems: stability and simulability. - Mathieu Hoyrup (Math. Struct. Comput. Sci., 2007)

Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (CoRR, 2008)

Computability and the morphological complexity of some dynamics on continuous domains. - Mathieu Hoyrup; Arda Kolçak; Giuseppe Longo (Theor. Comput. Sci., 2008)

An Application of Martin-Löf Randomness to Effective Probability Theory. - Mathieu Hoyrup; Cristobal Rojas (CiE, 2009)

Applications of Effective Probability Theory to Martin-Löf Randomness. - Mathieu Hoyrup; Cristobal Rojas (ICALP (1), 2009)

Computability of probability measures and Martin-Löf randomness over metric spaces. - Mathieu Hoyrup; Cristobal Rojas (Inf. Comput., 2009)

A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (Theor. Comput. Sci., 2009)

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (ISAAC (1), 2010)

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (CCA, 2010)

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (Inf. Comput., 2010)

Randomness and the Ergodic Decomposition. - Mathieu Hoyrup (CiE, 2011)

Dynamical systems, simulation, abstract computation - Stefano Galatolo; Mathieu Hoyrup; Cristobal Rojas (CoRR, 2011)

Algorithmic tests and randomness with respect to a class of measures - Laurent Bienvenu; Péter Gács; Mathieu Hoyrup; Cristobal Rojas; Alexander Shen 001 (CoRR, 2011)

Randomness on Computable Probability Spaces - A Dynamical Point of View. - Péter Gács; Mathieu Hoyrup; Cristobal Rojas (Theory Comput. Syst., 2011)

The dimension of ergodic random sequences. - Mathieu Hoyrup (STACS, 2012)

Computability of the Radon-Nikodym Derivative. - Mathieu Hoyrup; Cristobal Rojas; Klaus Weihrauch (Comput., 2012)

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. - Laurent Bienvenu; Adam R. Day; Mathieu Hoyrup; Ilya Mezhirov; Alexander Shen 001 (Inf. Comput., 2012)

On the Query Complexity of Real Functionals. - Hugo Férée; Mathieu Hoyrup; Walid Gomaa 001 (LICS, 2013)

Computability of the ergodic decomposition. - Mathieu Hoyrup (Ann. Pure Appl. Log., 2013)

Irreversible computable functions. - Mathieu Hoyrup (STACS, 2014)

Analytical properties of resource-bounded real functionals. - Hugo Férée; Walid Gomaa 001; Mathieu Hoyrup (J. Complex., 2014)

Immune Systems in Computer Virology. - Guillaume Bonfante; Mohamed El-Aqqad; Benjamin Greenbaum; Mathieu Hoyrup (CiE, 2015)

A Rice-like theorem for primitive recursive functions. - Mathieu Hoyrup (CoRR, 2015)

Characterizing polynomial time complexity of stream programs using interpretations. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (Theor. Comput. Sci., 2015)

The Typical Constructible Object. - Mathieu Hoyrup (CiE, 2016)

The Decidable Properties of Subrecursive Functions. - Mathieu Hoyrup (ICALP, 2016)

On the extension of computable real functions. - Mathieu Hoyrup; Walid Gomaa 001 (LICS, 2017)

Results in descriptive set theory on some represented spaces. - Mathieu Hoyrup (CoRR, 2017)

Layerwise Computability and Image Randomness. - Laurent Bienvenu; Mathieu Hoyrup; Alexander Shen 001 (Theory Comput. Syst., 2017)

Genericity of Weakly Computable Objects. - Mathieu Hoyrup (Theory Comput. Syst., 2017)

On the Information Carried by Programs About the Objects they Compute. - Mathieu Hoyrup; Cristobal Rojas (Theory Comput. Syst., 2017)

Topological Analysis of Representations. - Mathieu Hoyrup (CiE, 2018)

Semicomputable Geometry. - Mathieu Hoyrup; Diego Nava Saucedo; Don M. Stull (ICALP, 2018)

Computability on Quasi-Polish Spaces. - Mathieu Hoyrup; Cristobal Rojas; Victor L. Selivanov; Donald M. Stull (DCFS, 2019)

Semicomputable Points in Euclidean Spaces. - Mathieu Hoyrup; Donald M. Stull (MFCS, 2019)

Degrees of Non-computability of Homeomorphism Types of Polish Spaces. - Mathieu Hoyrup; Takayuki Kihara; Victor L. Selivanov (CiE, 2020)

Descriptive Complexity on Non-Polish Spaces II. - Mathieu Hoyrup (ICALP, 2020)

Descriptive Complexity on Non-Polish Spaces. - Antonin Callard; Mathieu Hoyrup (STACS, 2020)

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). - Mathieu Hoyrup; Arno Pauly; Victor L. Selivanov; Mariya Ivanova Soskova (Dagstuhl Reports, 2021)

Computability of Finite Simplicial Complexes. - Djamel Eddine Amir; Mathieu Hoyrup (ICALP, 2022)

The fixed-point property for represented spaces. - Mathieu Hoyrup (Ann. Pure Appl. Log., 2022)

Realizing semicomputable simplices by computable dynamical systems. - Daniel Coronel; Alexander Frank; Mathieu Hoyrup; Cristobal Rojas (Theor. Comput. Sci., 2022)

Topological Aspects of Representations in Computable Analysis. (Aspects Topologiques des Représentations en Analyse Calculable). - Mathieu Hoyrup (2023)

Strong computable type. - Djamel Eddine Amir; Mathieu Hoyrup (Comput., 2023)

Notes on overt choice. - Mathieu Hoyrup (Comput., 2023)

Comparing Computability in two Topologies. - Djamel Eddine Amir; Mathieu Hoyrup (J. Symb. Log., 2024)

Descriptive complexity of topological invariants. - Djamel Eddine Amir; Mathieu Hoyrup (Ann. Pure Appl. Log., 2025)