Publications
Liste
HAL
Travaux en cours ou soumis
- On the information carried by programs about the objects they compute.
Mathieu Hoyrup et Cristóbal Rojas. [pdf, HAL, arXiv]
- On the inversion of computable
functions.
Mathieu Hoyrup. [pdf, HAL]
Journaux
2014
- Analytical properties of resource-bounded real functionals.
Hugo Férée, Walid Gomaa, Mathieu Hoyrup.
Journal of Complexity, 30(5):647-671, 2014 [pdf, ee]
2013
- Computability of the ergodic
decomposition.
Mathieu Hoyrup.
Annals of Pure and Applied Logic, 164(5):542-549, 2013
[pdf, HAL, ee]
2012
- Computability of the Radon-Nikodym derivative.
Mathieu Hoyrup, Cristóbal Rojas et Klaus Weihrauch.
Computability, 1:1-11, 2012 [ee]
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points.
Laurent Bienvenu, Adam Day, Mathieu Hoyrup, Ilya Mezhirov et
Alexander Shen.
Information and
Computation, 210:21-30, 2012 [pdf, arXiv, ee]
2011
- Algorithmic tests and randomness with respect to a class of measures.
Laurent Bienvenu, Peter Gács, Mathieu Hoyrup, Cristóbal
Rojas et Alexander Shen.
Proceedings of the Steklov
Institute of Mathematics (Trudy Miran), 274(1):34-89 [pdf, pdf en russe, arXiv, ee]
- Dynamics and abstract computability: computing invariant measures.
Stefano Galatolo, Mathieu Hoyrup et Cristóbal
Rojas.
Discrete and Continuous Dynamical Systems - Series A, 29(1):193-212,
janvier 2011 [pdf, HAL,
ee]
- Randomness on Computable Probability Spaces-A
Dynamical Point of View.
Peter Gács, Mathieu Hoyrup et Cristóbal Rojas.
Theory of Computing Systems, 48(3):465-485, 2011
[ee]
2010
- Effective symbolic dynamics, random points, statistical behavior, complexity
and entropy.
Stefano Galatolo, Mathieu Hoyrup et Cristóbal Rojas.
Information and Computation, 208(1):23-41, 2010
[pdf, arXiv, HAL, ee]
2009
-
A
constructive Borel-Cantelli lemma. Constructing orbits with required
statistical properties.
Stefano Galatolo, Mathieu Hoyrup et Cristóbal Rojas.
Theoretical Computer Science, 410(21-23):2207-2222, 2009
[pdf, arXiv, ee]
-
Computability of probability measures and Martin-Löf randomness
over metric spaces.
Mathieu Hoyrup et Cristóbal Rojas.
Information and Computation, 207(7):830-847, 2009
[pdf, arXiv, ee]
2008
- Computability and the morphological complexity of some
dynamics on continuous domains.
Mathieu Hoyrup, Arda Kolçak et Giuseppe Longo.
Theoretical Computer Science,
398(1-3):170-182, 2008 [ee]
2007
- Dynamical systems: stability and simulability.
Mathieu Hoyrup.
Mathematical Structures in Computer Science,
17(2):247-259, 2007 [ee]
Conférences
2014
- Irreversible computable functions.
Mathieu Hoyrup.
STACS 2014. [pdf]
2013
- On the query complexity of real functionals.
Hugo Férée, Walid Gomaa et Mathieu
Hoyrup.
LICS 2013. [pdf, HAL]
2012
2011
- Computability of the Radon-Nikodym
derivative.
Mathieu Hoyrup, Cristóbal Rojas et Klaus
Weihrauch.
CiE
2011. LNCS, 6735:132-141, 2011 [pdf, ee, HAL]
- Randomness and the ergodic decomposition.
Mathieu Hoyrup.
CiE
2011. LNCS, 6735:122-131, 2011
[pdf, ee, HAL]
2010
- Interpretation of stream programs: characterizing type 2 polynomial time complexity.
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup
et Romain Péchoux.
ISAAC
2010. LNCS, 6506:291-303, 2010
[pdf, ee, HAL]
2009
- An application of Martin-Löf randomness to effective probability theory.
Mathieu Hoyrup et Cristóbal Rojas.
CiE 2009. LNCS, 5635:260-269, 2009
[pdf, ee]
- Applications of effective probability theory to Martin-Löf randomness.
Mathieu Hoyrup et Cristóbal Rojas.
ICALP 2009. LNCS, 5555:549-561, 2009
[pdf, ee]
- Randomness on computable probability spaces - a dynamical point of view.
Peter Gács, Mathieu Hoyrup et Cristóbal Rojas.
STACS 2009
[pdf, arXiv, HAL, DROPS]
2003
- Rewriting logic and probabilities.
Olivier Bournez et Mathieu Hoyrup.
RTA 2003. LNCS, 2706:61-75, 2003
[pdf, ee]
Surveys
- Statistical properties of dynamical systems - simulation and abstract computation.
Stefano Galatolo, Mathieu Hoyrup et Cristóbal
Rojas.
Chaos, Solitons and Fractals, 45(1):1-14, 2012. [HAL, ee]
- Computing the speed of convergence of ergodic
averages and pseudorandom points in computable dynamical
systems.
Stefano Galatolo, Mathieu Hoyrup, Cristóbal
Rojas.
Proceedings de CCA 2010. [arXiv, HAL]
- Une brève introduction à la
théorie effective de l'aléatoire.
Laurent Bienvenu, Mathieu Hoyrup.
Gazette des mathématiciens, 123:35-47, 2010.
[pdf, lien,
HAL]
Autres travaux
- Computability of invariant measures: two counter-examples .
Stefano Galatolo, Mathieu Hoyrup et Cristóbal Rojas. [pdf]
- Absolute continuity of measures and preservation of randomness.
Mathieu Hoyrup et Cristóbal Rojas. [pdf]
Thèse
- Calculabilité, aléatoire et théorie ergodique sur les espaces métriques.
Thèse de doctorat de l'Université Paris Diderot (Paris VII), 2008.
- version électronique (avec hyperliens) [pdf]
- version imprimable (sans hyperliens, pages impaires à droite) [pdf]
- archive [TEL]
- résumé en français [pdf]
- résumé en anglais [pdf]