Mathieu Hoyrup

According to our database, Mathieu Hoyrup authored at least 48 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Comparing Computability in two Topologies.

Djamel Eddine Amir, Mathieu Hoyrup

J. Symb. Log., 2024

2023

Notes on overt choice.

Mathieu Hoyrup

Comput., 2023

Strong computable type.

Djamel Eddine Amir, Mathieu Hoyrup

Comput., 2023

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

Mathieu Hoyrup

, 2023

2022

Realizing semicomputable simplices by computable dynamical systems.

Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristobal Rojas

Theor. Comput. Sci., 2022

The fixed-point property for represented spaces.

Mathieu Hoyrup

Ann. Pure Appl. Log., 2022

Computability of Finite Simplicial Complexes.

Djamel Eddine Amir, Mathieu Hoyrup

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).

Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova

Dagstuhl Reports, 2021

2020

Descriptive Complexity on Non-Polish Spaces.

Antonin Callard, Mathieu Hoyrup

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Descriptive Complexity on Non-Polish Spaces II.

Mathieu Hoyrup

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Degrees of Non-computability of Homeomorphism Types of Polish Spaces.

Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Semicomputable Points in Euclidean Spaces.

Mathieu Hoyrup, Donald M. Stull

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Computability on Quasi-Polish Spaces.

Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Semicomputable Geometry.

Mathieu Hoyrup, Diego Nava Saucedo, Don M. Stull

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Topological Analysis of Representations.

Mathieu Hoyrup

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

On the Information Carried by Programs About the Objects they Compute.

Mathieu Hoyrup, Cristobal Rojas

Theory Comput. Syst., 2017

Genericity of Weakly Computable Objects.

Mathieu Hoyrup

Theory Comput. Syst., 2017

Layerwise Computability and Image Randomness.

Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen

Theory Comput. Syst., 2017

Results in descriptive set theory on some represented spaces.

Mathieu Hoyrup

CoRR, 2017

On the extension of computable real functions.

Mathieu Hoyrup, Walid Gomaa

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

The Decidable Properties of Subrecursive Functions.

Mathieu Hoyrup

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Typical Constructible Object.

Mathieu Hoyrup

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

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

A Rice-like theorem for primitive recursive functions.

Mathieu Hoyrup

CoRR, 2015

Immune Systems in Computer Virology.

Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Analytical properties of resource-bounded real functionals.

Hugo Férée, Walid Gomaa, Mathieu Hoyrup

J. Complex., 2014

Irreversible computable functions.

Mathieu Hoyrup

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

Computability of the ergodic decomposition.

Mathieu Hoyrup

Ann. Pure Appl. Log., 2013

On the Query Complexity of Real Functionals.

Hugo Férée, Mathieu Hoyrup, Walid Gomaa

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

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

Inf. Comput., 2012

Computability of the Radon-Nikodym Derivative.

Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch

Comput., 2012

The dimension of ergodic random sequences.

Mathieu Hoyrup

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

Randomness on Computable Probability Spaces - A Dynamical Point of View.

Péter Gács, Mathieu Hoyrup, Cristobal Rojas

Theory Comput. Syst., 2011

Algorithmic tests and randomness with respect to a class of measures

Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen

CoRR, 2011

Dynamical systems, simulation, abstract computation

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

CoRR, 2011

Randomness and the Ergodic Decomposition.

Mathieu Hoyrup

Proceedings of the Models of Computation in Context, 2011

2010

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy.

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

Inf. Comput., 2010

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.

Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties.

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

Theor. Comput. Sci., 2009

Computability of probability measures and Martin-Löf randomness over metric spaces.

Mathieu Hoyrup, Cristobal Rojas

Inf. Comput., 2009

Applications of Effective Probability Theory to Martin-Löf Randomness.

Mathieu Hoyrup, Cristobal Rojas

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

An Application of Martin-Löf Randomness to Effective Probability Theory.

Mathieu Hoyrup, Cristobal Rojas

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Computability and the morphological complexity of some dynamics on continuous domains.

Mathieu Hoyrup, Arda Kolçak, Giuseppe Longo

Theor. Comput. Sci., 2008

Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

CoRR, 2008

2007

Dynamical systems: stability and simulability.

Mathieu Hoyrup

Math. Struct. Comput. Sci., 2007

An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas

CoRR, 2007

2003

Rewriting Logic and Probabilities.

Olivier Bournez, Mathieu Hoyrup

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003