Mots-clés

Nombre de documents

31

Mathieu Hoyrup's publications


Article dans une revue9 documents

Communication dans un congrès16 documents

  • Mathieu Hoyrup, Walid Gomaa. On the extension of computable real functions. Logic In Computer Science (LICS), Jun 2017, Reykjavik, Iceland. <http://lics.rwth-aachen.de/lics17/>. <hal-01494332>
  • Mathieu Hoyrup. The Typical Constructible Object. Computability In Europe, Jun 2016, Paris, France. pp.115 - 123, 2016, <https://lipn.univ-paris13.fr/CIE2016/>. <10.1007/978-3-319-40189-8_12>. <hal-01396167>
  • Mathieu Hoyrup, Cristobal Rojas. On the information carried by programs about the objects they compute. STACS15, Mar 2015, Munich, Germany. <http://www14.in.tum.de/konferenzen/STACS2015/>. <hal-01067618>
  • Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup. Immune Systems in Computer Virology. Computability in Europe 2015, Jun 2015, Bucharest, Romania. Springer, 9136, pp.10, Evolving Computability. <http://link.springer.com/chapter/10.1007%2F978-3-319-20028-6_13>. <10.1007/978-3-319-20028-6_13>. <hal-01208454>
  • Mathieu Hoyrup. Irreversible computable functions. STACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014, Mar 2014, Lyon, France. 2014. <hal-00915952v4>
  • Hugo Férée, Mathieu Hoyrup, Walid Gomaa. On the query complexity of real functionals. LICS - 28th ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.103-112, 2013, <http://www.computer.org/csdl/proceedings/lics/2013/5020/00/5020a103-abs.html>. <10.1109/LICS.2013.15>. <hal-00773653>
  • Hugo Férée, Mathieu Hoyrup. Higher-order complexity in analysis. CCA - 10th International Conference on Computability and Complexity in Analysis - 2013, Jul 2013, Nancy, France. 2013. <hal-00915973>
  • Mathieu Hoyrup. The dimension of ergodic random sequences. Christoph Dürr and Thomas Wilke. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. LIPIcs, 14, pp.567-576, 2011. <inria-00606457v4>
  • Mathieu Hoyrup. Randomness and the ergodic decomposition. Computability in Europe, Jun 2011, Sofia, Bulgaria. 6735, pp.122-131, 2011, Lecture Notes in Computer Science. <inria-00586736>
  • Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. Computability of the Radon-Nikodym derivative. Benedikt Löwe and Dag Normann and Ivan Soskov and Alexandra Soskova. Computability in Europe, Jun 2011, Sofia, Bulgaria. Springer-Verlag, 6735, pp.132-141, 2011, LNCS; Models of Computation in Context. <inria-00586740>
  • Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. Xizhong Zheng and Ning Zhong. Computability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. 24, pp.7-18, 2010, Electronic Proceedings in Theoretical Computer Science; Proceedings Seventh International Conference on Computability and Complexity in Analysis. <http://arxiv.org/abs/1006.0392v1>. <10.4204/EPTCS.24.6>. <inria-00517372>
  • Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Interpretation of stream programs: characterizing type 2 polynomial time complexity. 21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea. Springer, 2010. <inria-00518381>
  • Mathieu Hoyrup, Cristobal Rojas. Applications of Effective Probability Theory to Martin-Löf Randomness. Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas and Wolfgang Thomas. 36th International Colloquium on Automata, Languages and Programming - ICALP 2009, Jul 2009, Rhodes, Greece. Springer Berlin / Heidelberg, 5555, pp.549-561, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-02927-1>. <hal-00425560v2>
  • Mathieu Hoyrup, Cristobal Rojas. An Application of Martin-Löf Randomness to Effective Probability Theory. Klaus Ambos-Spies and Benedikt Löwe and Wolfgang Merkle. 5th Conference on Computability in Europe - CiE 2009, Jul 2009, Heidelberg, Germany. Springer Berlin / Heidelberg, 5635, pp.260-269, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-03073-4>. <hal-00425556>
  • Peter Gacs, Mathieu Hoyrup, Cristobal Rojas. Randomness on Computable Probability Spaces - A Dynamical Point of View. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.469-480, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. <inria-00360519>
  • Olivier Bournez, Mathieu Hoyrup. Rewriting Logic and Probabilities. Robert Nieuwenhuis. 14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, Springer, 2706, pp.61-75, 2003, Lecture Notes in Computer Science. <inria-00099620>

Autre publication2 documents

  • Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise computability and image randomness. submitted. 2016. <lirmm-01486486>
  • Mathieu Hoyrup. Que calcule cet algorithme ? : Lire un algorithme donne-t-il plus d’information sur ce qu’il calcule que de l’exécuter aveuglément ?. Article de vulgarisation présentant un travail de recherche récent, publié dans Images des Mathém.. 2015. <hal-01202984>

Rapport3 documents

  • Mathieu Hoyrup. A Rice-like theorem for primitive recursive functions. [Research Report] Inria Nancy - Grand Est (Villers-lès-Nancy, France); Loria. 2015. <hal-01130868>
  • Mathieu Hoyrup. On the inversion of computable functions. [Research Report] 2012. <hal-00735681v2>
  • Mathieu Hoyrup. Réécriture en présence de choix probabilistes. [Stage] A02-R-424 || hoyrup02a, 2002. <inria-00100886>

Thèse1 document

  • Mathieu Hoyrup. Calculabilité, aléatoire et théorie ergodique sur les espaces métriques. Mathématiques [math]. Université Paris-Diderot - Paris VII, 2008. Français. <tel-00322776>