Mathieu Hoyrup
Publications
Publications
|
|
Computability of finite simplicial complexesICALP, Jul 2022, Paris, France |
|
|
Descriptive complexity on non-Polish spacesSTACS 2020 - 37th Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.16, ⟨10.4230/LIPIcs.STACS.2020.8⟩ |
|
|
Descriptive complexity on non-Polish spaces IIICALP, Jul 2020, Saarbrücken, Germany. ⟨10.4230/LIPIcs.ICALP.2020.132⟩ |
|
|
Computability on quasi-Polish spacesDCFS 2019 - 21st International Conference on Descriptional Complexity of Formal Systems, Jul 2019, Kosice, Slovakia. pp.171-183 |
|
|
Semicomputable points in Euclidean spacesMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.63⟩ |
|
|
Semicomputable geometryICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic |
|
|
Topological analysis of representationsCiE 2018 - Fourteenth conference on Computability in Europe, Jul 2018, Kiel, Germany |
|
|
On the extension of computable real functionsLogic In Computer Science (LICS), Jun 2017, Reykjavik, Iceland |
|
|
The decidable properties of subrecursive functionsInternational Colloquium on Automata, Languages, and Programming (ICALP) 2016, Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.108⟩ |
|
|
The Typical Constructible ObjectComputability In Europe, Jun 2016, Paris, France. pp.115 - 123, ⟨10.1007/978-3-319-40189-8_12⟩ |
|
|
On the information carried by programs about the objects they computeSTACS15, Mar 2015, Munich, Germany |
Immune Systems in Computer VirologyComputability in Europe 2015, Jun 2015, Bucharest, Romania. pp.10, ⟨10.1007/978-3-319-20028-6_13⟩ |
|
|
|
Irreversible computable functionsSTACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014, Mar 2014, Lyon, France |
|
|
Higher-order complexity in analysisCCA - 10th International Conference on Computability and Complexity in Analysis - 2013, Jul 2013, Nancy, France |
|
|
On the query complexity of real functionalsLICS - 28th ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.103-112, ⟨10.1109/LICS.2013.15⟩ |
|
|
Computability of the Radon-Nikodym derivativeComputability in Europe, Jun 2011, Sofia, Bulgaria. pp.132-141 |
|
|
Randomness and the ergodic decompositionComputability in Europe, Jun 2011, Sofia, Bulgaria. pp.122-131 |
|
|
The dimension of ergodic random sequencesSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.567-576 |
|
|
Interpretation of stream programs: characterizing type 2 polynomial time complexity21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea |
|
|
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systemsComputability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. pp.7-18, ⟨10.4204/EPTCS.24.6⟩ |
|
|
Randomness on Computable Probability Spaces - A Dynamical Point of View26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.469-480 |
|
|
An Application of Martin-Löf Randomness to Effective Probability Theory5th Conference on Computability in Europe - CiE 2009, Jul 2009, Heidelberg, Germany. pp.260-269, ⟨10.1007/978-3-642-03073-4⟩ |
|
|
Applications of Effective Probability Theory to Martin-Löf Randomness36th International Colloquium on Automata, Languages and Programming - ICALP 2009, Jul 2009, Rhodes, Greece. pp.549-561, ⟨10.1007/978-3-642-02927-1⟩ |
Rewriting Logic and Probabilities14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.61-75 |
|
|
Computable Measure Theory and Algorithmic RandomnessHandbook of Computable Analysis, pp.227-270, 2021, 978-3-030-59234-9. ⟨10.1007/978-3-030-59234-9_7⟩ |
|
|
Algorithmic randomness and layerwise computabilityJohanna N. Y. Franklin; Christopher P. Porter. Algorithmic Randomness -- Progress and Prospects, Cambridge University Press, pp.17, 2020, ⟨10.1017/9781108781718⟩ |
Que calcule cet algorithme ?2015 |
|
|
Local generation of languages: the monotonic binary sequences2026 |
|
|
Local generation of languages2025 |
|
|
Local generation of tilings: the even bicolor Wang tilesets2025 |
|
|
Results in descriptive set theory on some represented spaces2018 |
|
|
A Rice-like theorem for primitive recursive functions[Research Report] Inria Nancy - Grand Est (Villers-lès-Nancy, France); Loria. 2015 |
|
|
On the inversion of computable functions[Research Report] 2012 |
Réécriture en présence de choix probabilistes[Stage] A02-R-424 || hoyrup02a, 2002 |
|
|
Calculabilité, aléatoire et théorie ergodique sur les espaces métriquesMathématiques [math]. Université Paris-Diderot - Paris VII, 2008. Français. ⟨NNT : ⟩ |
|
|
Topological Aspects of Representations in Computable AnalysisComputer Science [cs]. Université de Lorraine, 2023 |