Mathieu Hoyrup

59 papers A* 6A 5B 1C 8Journal 34Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Local generation of languages: the monotonic binary sequences. CoRR Mathieu Hoyrup
2025	J	`jnl`	Descriptive complexity of topological invariants. Ann. Pure Appl. Log. Djamel Eddine Amir, Mathieu Hoyrup
2025	J	`jnl`	Local generation of languages. CoRR Mathieu Hoyrup
2024	J	`jnl`	Comparing Computability in two Topologies. J. Symb. Log. Djamel Eddine Amir, Mathieu Hoyrup
2023	J	`jnl`	Notes on overt choice. Comput. Mathieu Hoyrup
2023	J	`jnl`	Strong computable type. Comput. Djamel Eddine Amir, Mathieu Hoyrup
2023	—	`book`	Topological Aspects of Representations in Computable Analysis. (Aspects Topologiques des Représentations en Analyse Calculable). Mathieu Hoyrup
2022	A*	`conf`	Computability of Finite Simplicial Complexes. ICALP Djamel Eddine Amir, Mathieu Hoyrup
2022	J	`jnl`	Realizing semicomputable simplices by computable dynamical systems. Theor. Comput. Sci. Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristobal Rojas
2022	J	`jnl`	The fixed-point property for represented spaces. Ann. Pure Appl. Log. Mathieu Hoyrup
2021	J	`jnl`	Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova
2020	C	`conf`	Degrees of Non-computability of Homeomorphism Types of Polish Spaces. CiE Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov
2020	A*	`conf`	Descriptive Complexity on Non-Polish Spaces II. ICALP Mathieu Hoyrup
2020	A	`conf`	Descriptive Complexity on Non-Polish Spaces. STACS Antonin Callard, Mathieu Hoyrup
2019	—	`conf`	Computability on Quasi-Polish Spaces. DCFS Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull
2019	B	`conf`	Semicomputable Points in Euclidean Spaces. MFCS Mathieu Hoyrup, Donald M. Stull
2018	A*	`conf`	Semicomputable Geometry. ICALP Mathieu Hoyrup, Diego Nava Saucedo, Don M. Stull
2018	C	`conf`	Topological Analysis of Representations. CiE Mathieu Hoyrup
2017	J	`jnl`	Genericity of Weakly Computable Objects. Theory Comput. Syst. Mathieu Hoyrup
2017	J	`jnl`	Layerwise Computability and Image Randomness. Theory Comput. Syst. Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
2017	J	`jnl`	On the Information Carried by Programs About the Objects they Compute. Theory Comput. Syst. Mathieu Hoyrup, Cristobal Rojas
2017	A*	`conf`	On the extension of computable real functions. LICS Mathieu Hoyrup, Walid Gomaa
2017	J	`jnl`	Results in descriptive set theory on some represented spaces. CoRR Mathieu Hoyrup
2016	J	`jnl`	Layerwise computability and image randomness. CoRR Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
2016	A*	`conf`	The Decidable Properties of Subrecursive Functions. ICALP Mathieu Hoyrup
2016	C	`conf`	The Typical Constructible Object. CiE Mathieu Hoyrup
2015	J	`jnl`	A Rice-like theorem for primitive recursive functions. CoRR Mathieu Hoyrup
2015	J	`jnl`	Characterizing polynomial time complexity of stream programs using interpretations. Theor. Comput. Sci. Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2015	C	`conf`	Immune Systems in Computer Virology. CiE Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup
2015	A	`conf`	On the Information Carried by Programs about the Objects They Compute. STACS Mathieu Hoyrup, Cristobal Rojas
2014	J	`jnl`	Analytical properties of resource-bounded real functionals. J. Complex. Hugo Férée, Walid Gomaa, Mathieu Hoyrup
2014	A	`conf`	Irreversible computable functions. STACS Mathieu Hoyrup
2014	J	`jnl`	On the information carried by programs about the objects they compute. CoRR Mathieu Hoyrup, Cristobal Rojas
2013	J	`jnl`	Computability of the ergodic decomposition. Ann. Pure Appl. Log. Mathieu Hoyrup
2013	A*	`conf`	On the Query Complexity of Real Functionals. LICS Hugo Férée, Mathieu Hoyrup, Walid Gomaa
2012	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2012	J	`jnl`	Computability of the Radon-Nikodym Derivative. Comput. Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
2012	A	`conf`	The dimension of ergodic random sequences. STACS Mathieu Hoyrup
2011	J	`jnl`	Algorithmic tests and randomness with respect to a class of measures CoRR Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen
2011	C	`conf`	Computability of the Radon-Nikodym Derivative. CiE Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
2011	J	`jnl`	Dynamical systems, simulation, abstract computation CoRR Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2011	C	`conf`	Randomness and the Ergodic Decomposition. CiE Mathieu Hoyrup
2011	J	`jnl`	Randomness on Computable Probability Spaces - A Dynamical Point of View. Theory Comput. Syst. Péter Gács, Mathieu Hoyrup, Cristobal Rojas
2011	J	`jnl`	The dimension of ergodic random sequences CoRR Mathieu Hoyrup
2010	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points CoRR Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2010	C	`conf`	Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems CCA Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2010	J	`jnl`	Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2010	—	`conf`	Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2009	J	`jnl`	A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. Theor. Comput. Sci. Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2009	C	`conf`	An Application of Martin-Löf Randomness to Effective Probability Theory. CiE Mathieu Hoyrup, Cristobal Rojas
2009	—	`conf`	Applications of Effective Probability Theory to Martin-Löf Randomness. ICALP (1) Mathieu Hoyrup, Cristobal Rojas
2009	J	`jnl`	Computability of probability measures and Martin-Löf randomness over metric spaces. Inf. Comput. Mathieu Hoyrup, Cristobal Rojas
2009	A	`conf`	Randomness on Computable Probability Spaces - A Dynamical Point of View. STACS Péter Gács, Mathieu Hoyrup, Cristobal Rojas
2008	J	`jnl`	Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy CoRR Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2008	J	`jnl`	Computability and the morphological complexity of some dynamics on continuous domains. Theor. Comput. Sci. Mathieu Hoyrup, Arda Kolçak, Giuseppe Longo
2007	J	`jnl`	An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties CoRR Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
2007	J	`jnl`	Computability of probability measures and Martin-Lof randomness over metric spaces CoRR Mathieu Hoyrup, Cristobal Rojas
2007	J	`jnl`	Dynamical systems: stability and simulability. Math. Struct. Comput. Sci. Mathieu Hoyrup
2003	—	`conf`	Rewriting Logic and Probabilities. RTA Olivier Bournez, Mathieu Hoyrup