Skip to Main content

Keywords

Number of documents

50

Mathieu Hoyrup's publications


Journal articles15 documents

  • Mathieu Hoyrup. The fixed-point property for represented spaces. Annals of Pure and Applied Logic, Elsevier Masson, 2022, 173 (5). ⟨hal-03117745v2⟩
  • Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise Computability and Image Randomness. Theory of Computing Systems, Springer Verlag, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩. ⟨hal-01650910⟩
  • Mathieu Hoyrup. Genericity of weakly computable objects. Theory of Computing Systems, Springer Verlag, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩. ⟨hal-01095864v2⟩
  • Mathieu Hoyrup, Cristóbal Rojas. On the Information Carried by Programs About the Objects they Compute. Theory of Computing Systems, Springer Verlag, 2017, ⟨10.1007/s00224-016-9726-9⟩. ⟨hal-01413066⟩
  • Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Characterizing polynomial time complexity of stream programs using interpretations. Theoretical Computer Science, Elsevier, 2015, 585, pp.41-54. ⟨10.1016/j.tcs.2015.03.008⟩. ⟨hal-01112160⟩
  • Hugo Férée, Walid Gomaa, Mathieu Hoyrup. Analytical properties of resource-bounded real functionals. Journal of Complexity, Elsevier, 2014, 30 (5), pp.33. ⟨10.1016/j.jco.2014.02.008⟩. ⟨hal-00848482⟩
  • Mathieu Hoyrup. Computability of the ergodic decomposition. Annals of Pure and Applied Logic, Elsevier Masson, 2013, 164 (5), pp.542-549. ⟨10.1016/j.apal.2012.11.005⟩. ⟨hal-00746473⟩
  • Laurent Bienvenu, Adam Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen. A constructive version of Birkhoff's ergodic theorem for Martin-Lof random points. Information and Computation, Elsevier, 2012, 210, pp.021-030. ⟨10.1016/j.ic.2011.10.006⟩. ⟨hal-00643629⟩
  • Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Statistical properties of dynamical systems - simulation and abstract computation.. Chaos, Solitons and Fractals, Elsevier, 2012, 45 (1), pp.1-14. ⟨10.1016/j.chaos.2011.09.011⟩. ⟨hal-00644790⟩
  • Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. Computability of the Radon-Nikodym derivative.. Computability, IOS Press, 2012, 1 (1), pp.3-13. ⟨10.3233/COM-2012-005⟩. ⟨hal-00726044⟩
  • Peter Gacs, Mathieu Hoyrup, Cristobal Rojas. Randomness on Computable Probability Spaces—A Dynamical Point of View. Theory of Computing Systems, Springer Verlag, 2011, 48 (3), pp.465--485. ⟨10.1007/s00224-010-9263-x⟩. ⟨inria-00531640⟩
  • Laurent Bienvenu, Peter Gacs, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen. Algorithmic tests and randomness with respect to a class of measures. Proceedings of the Steklov Institute of Mathematics, MAIK Nauka/Interperiodica, 2011, 274 (1), pp.34-89. ⟨10.1134/S0081543811060058⟩. ⟨hal-00644785⟩
  • Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Dynamics and abstract computability: computing invariant measures. Discrete and Continuous Dynamical Systems - Series A, American Institute of Mathematical Sciences, 2011, 29 (1), pp.193-212. ⟨10.3934/dcds.2011.29.193⟩. ⟨inria-00517367⟩
  • Laurent Bienvenu, Mathieu Hoyrup. Une brève introduction à la théorie effective de l'aléatoire. Gazette des Mathématiciens, Société Mathématique de France, 2010, 123, pp.35-47. ⟨inria-00449022⟩
  • Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Information and Computation, Elsevier, 2010, 208 (1), pp.23-41. ⟨10.1016/j.ic.2009.05.001⟩. ⟨inria-00517382⟩

Conference papers24 documents

  • Djamel Eddine Amir, Mathieu Hoyrup. Computability of finite simplicial complexes. ICALP, Jul 2022, Paris, France. ⟨hal-03564904⟩
  • Antonin Callard, Mathieu Hoyrup. Descriptive complexity on non-Polish spaces. STACS 2020 - 37th Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.16, ⟨10.4230/LIPIcs.STACS.2020.8⟩. ⟨hal-02298815v3⟩
  • Mathieu Hoyrup. Descriptive complexity on non-Polish spaces II. ICALP, Jul 2020, Saarbrücken, Germany. ⟨10.4230/LIPIcs.ICALP.2020.132⟩. ⟨hal-02483114⟩
  • Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M Stull. Computability on quasi-Polish spaces. DCFS 2019 - 21st International Conference on Descriptional Complexity of Formal Systems, Jul 2019, Kosice, Slovakia. pp.171-183. ⟨hal-02118947v2⟩
  • Mathieu Hoyrup, Donald M Stull. Semicomputable points in Euclidean spaces. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.63⟩. ⟨hal-02154825⟩
  • Mathieu Hoyrup. Topological analysis of representations. CiE 2018 - Fourteenth conference on Computability in Europe, Jul 2018, Kiel, Germany. ⟨hal-01919395⟩
  • Mathieu Hoyrup, Diego Nava Saucedo, Donald M Stull. Semicomputable geometry. ICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. ⟨hal-01770562⟩
  • Mathieu Hoyrup, Walid Gomaa. On the extension of computable real functions. Logic In Computer Science (LICS), Jun 2017, Reykjavik, Iceland. ⟨hal-01494332⟩
  • Mathieu Hoyrup. The decidable properties of subrecursive functions. International Colloquium on Automata, Languages, and Programming (ICALP) 2016, Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.108⟩. ⟨hal-01308224⟩
  • Mathieu Hoyrup. The Typical Constructible Object. Computability In Europe, Jun 2016, Paris, France. pp.115 - 123, ⟨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. ⟨hal-01067618⟩
  • Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup. Immune Systems in Computer Virology. Computability in Europe 2015, Jun 2015, Bucharest, Romania. pp.10, ⟨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. ⟨hal-00915952v4⟩
  • 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. ⟨hal-00915973⟩
  • 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, ⟨10.1109/LICS.2013.15⟩. ⟨hal-00773653⟩
  • Mathieu Hoyrup. The dimension of ergodic random sequences. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.567-576. ⟨inria-00606457v4⟩
  • Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. Computability of the Radon-Nikodym derivative. Computability in Europe, Jun 2011, Sofia, Bulgaria. pp.132-141. ⟨inria-00586740⟩
  • Mathieu Hoyrup. Randomness and the ergodic decomposition. Computability in Europe, Jun 2011, Sofia, Bulgaria. pp.122-131. ⟨inria-00586736⟩
  • Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. Computability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. pp.7-18, ⟨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. ⟨inria-00518381⟩
  • Peter Gacs, Mathieu Hoyrup, Cristobal Rojas. Randomness on Computable Probability Spaces - A Dynamical Point of View. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.469-480. ⟨inria-00360519⟩
  • Mathieu Hoyrup, Cristobal Rojas. Applications of Effective Probability Theory to Martin-Löf Randomness. 36th International Colloquium on Automata, Languages and Programming - ICALP 2009, Jul 2009, Rhodes, Greece. pp.549-561, ⟨10.1007/978-3-642-02927-1⟩. ⟨hal-00425560v2⟩
  • Mathieu Hoyrup, Cristobal Rojas. An Application of Martin-Löf Randomness to Effective Probability Theory. 5th Conference on Computability in Europe - CiE 2009, Jul 2009, Heidelberg, Germany. pp.260-269, ⟨10.1007/978-3-642-03073-4⟩. ⟨hal-00425556⟩
  • Olivier Bournez, Mathieu Hoyrup. Rewriting Logic and Probabilities. 14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.61-75. ⟨inria-00099620⟩

Book sections2 documents

Other publications1 document

  • 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 ?. 2015. ⟨hal-01202984⟩

Preprints, Working Papers, ...4 documents

  • Djamel Eddine Amir, Mathieu Hoyrup. Comparing computability in two topologies. 2022. ⟨hal-03702999⟩
  • Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristóbal Rojas. Realizing semicomputable simplices by computable dynamical systems. 2021. ⟨hal-03339422⟩
  • Mathieu Hoyrup, Takayuki Kihara, Victor Selivanov. Degree Spectra of Homeomorphism Types of Polish Spaces. 2020. ⟨hal-02555111⟩
  • Mathieu Hoyrup. Results in descriptive set theory on some represented spaces. 2018. ⟨hal-01657883⟩

Reports3 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⟩

Theses1 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⟩