default search action
Mathieu Hoyrup
Person information
- affiliation: University of Lorraine, Nancy, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b1]Mathieu Hoyrup:
Topological Aspects of Representations in Computable Analysis. (Aspects Topologiques des Représentations en Analyse Calculable). University of Lorraine, Nancy, France, 2023 - [j18]Djamel Eddine Amir, Mathieu Hoyrup:
Strong computable type. Comput. 12(3): 227-269 (2023) - [j17]Mathieu Hoyrup:
Notes on overt choice. Comput. 12(4): 351-369 (2023) - 2022
- [j16]Mathieu Hoyrup:
The fixed-point property for represented spaces. Ann. Pure Appl. Log. 173(5): 103090 (2022) - [j15]Daniel Coronel
, Alexander Frank, Mathieu Hoyrup
Realizing semicomputable simplices by computable dynamical systems. Theor. Comput. Sci. 933: 43-54 (2022) - [c24]Djamel Eddine Amir, Mathieu Hoyrup:
Computability of Finite Simplicial Complexes. ICALP 2022: 111:1-111:16 - 2021
- [i12]Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova:
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports 11(10): 72-93 (2021) - 2020
- [c23]Mathieu Hoyrup, Takayuki Kihara
Degrees of Non-computability of Homeomorphism Types of Polish Spaces. CiE 2020: 189-192 - [c22]Mathieu Hoyrup:
Descriptive Complexity on Non-Polish Spaces II. ICALP 2020: 132:1-132:17 - [c21]Antonin Callard
Descriptive Complexity on Non-Polish Spaces. STACS 2020: 8:1-8:16
2010 – 2019
- 2019
- [c20]Mathieu Hoyrup, Cristobal Rojas
Computability on Quasi-Polish Spaces. DCFS 2019: 171-183 - [c19]Mathieu Hoyrup, Donald M. Stull:
Semicomputable Points in Euclidean Spaces. MFCS 2019: 48:1-48:13 - 2018
- [c18]Mathieu Hoyrup:
Topological Analysis of Representations. CiE 2018: 214-223 - [c17]Mathieu Hoyrup, Diego Nava Saucedo, Don M. Stull:
Semicomputable Geometry. ICALP 2018: 129:1-129:13 - 2017
- [j14]Mathieu Hoyrup:
Genericity of Weakly Computable Objects. Theory Comput. Syst. 60(3): 396-420 (2017) - [j13]Mathieu Hoyrup
On the Information Carried by Programs About the Objects they Compute. Theory Comput. Syst. 61(4): 1214-1236 (2017) - [j12]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Layerwise Computability and Image Randomness. Theory Comput. Syst. 61(4): 1353-1375 (2017) - [c16]Mathieu Hoyrup, Walid Gomaa:
On the extension of computable real functions. LICS 2017: 1-12 - [i11]Mathieu Hoyrup:
Results in descriptive set theory on some represented spaces. CoRR abs/1712.03680 (2017) - 2016
- [c15]Mathieu Hoyrup:
The Typical Constructible Object. CiE 2016: 115-123 - [c14]Mathieu Hoyrup:
The Decidable Properties of Subrecursive Functions. ICALP 2016: 108:1-108:13 - [i10]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen:
Layerwise computability and image randomness. CoRR abs/1607.04232 (2016) - 2015
- [j11]Hugo Férée
Characterizing polynomial time complexity of stream programs using interpretations. Theor. Comput. Sci. 585: 41-54 (2015) - [c13]Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup:
Immune Systems in Computer Virology. CiE 2015: 127-136 - [c12]Mathieu Hoyrup, Cristobal Rojas
On the Information Carried by Programs about the Objects They Compute. STACS 2015: 447-459 - [i9]Mathieu Hoyrup:
A Rice-like theorem for primitive recursive functions. CoRR abs/1503.05025 (2015) - 2014
- [j10]Hugo Férée
Analytical properties of resource-bounded real functionals. J. Complex. 30(5): 647-671 (2014) - [c11]Mathieu Hoyrup:
Irreversible computable functions. STACS 2014: 362-373 - [i8]Mathieu Hoyrup, Cristobal Rojas:
On the information carried by programs about the objects they compute. CoRR abs/1409.6977 (2014) - 2013
- [j9]Mathieu Hoyrup:
Computability of the ergodic decomposition. Ann. Pure Appl. Log. 164(5): 542-549 (2013) - [c10]Hugo Férée
On the Query Complexity of Real Functionals. LICS 2013: 103-112 - 2012
- [j8]Mathieu Hoyrup, Cristobal Rojas
Computability of the Radon-Nikodym Derivative. Comput. 1(1): 3-13 (2012) - [j7]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. 210: 21-30 (2012) - [c9]Mathieu Hoyrup:
The dimension of ergodic random sequences. STACS 2012: 567-576 - 2011
- [j6]Péter Gács, Mathieu Hoyrup, Cristobal Rojas
Randomness on Computable Probability Spaces - A Dynamical Point of View. Theory Comput. Syst. 48(3): 465-485 (2011) - [c8]Mathieu Hoyrup:
Randomness and the Ergodic Decomposition. CiE 2011: 122-131 - [c7]Mathieu Hoyrup, Cristobal Rojas
Computability of the Radon-Nikodym Derivative. CiE 2011: 132-141 - [i7]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
Dynamical systems, simulation, abstract computation. CoRR abs/1101.0833 (2011) - [i6]Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen:
Algorithmic tests and randomness with respect to a class of measures. CoRR abs/1103.1529 (2011) - [i5]Mathieu Hoyrup:
The dimension of ergodic random sequences. CoRR abs/1107.1149 (2011) - 2010
- [j5]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. 208(1): 23-41 (2010) - [c6]Hugo Férée
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) 2010: 291-303 - [c5]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. CCA 2010: 7-18 - [i4]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen:
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. CoRR abs/1007.5249 (2010)
2000 – 2009
- 2009
- [j4]Mathieu Hoyrup, Cristobal Rojas
Computability of probability measures and Martin-Löf randomness over metric spaces. Inf. Comput. 207(7): 830-847 (2009) - [j3]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties. Theor. Comput. Sci. 410(21-23): 2207-2222 (2009) - [c4]Mathieu Hoyrup, Cristobal Rojas
An Application of Martin-Löf Randomness to Effective Probability Theory. CiE 2009: 260-269 - [c3]Mathieu Hoyrup, Cristobal Rojas
Applications of Effective Probability Theory to Martin-Löf Randomness. ICALP (1) 2009: 549-561 - [c2]Péter Gács, Mathieu Hoyrup, Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View. STACS 2009: 469-480 - 2008
- [j2]Mathieu Hoyrup, Arda Kolçak, Giuseppe Longo:
Computability and the morphological complexity of some dynamics on continuous domains. Theor. Comput. Sci. 398(1-3): 170-182 (2008) - [i3]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy. CoRR abs/0801.0209 (2008) - 2007
- [j1]Mathieu Hoyrup:
Dynamical systems: stability and simulability. Math. Struct. Comput. Sci. 17(2): 247-259 (2007) - [i2]Mathieu Hoyrup, Cristobal Rojas:
Computability of probability measures and Martin-Lof randomness over metric spaces. CoRR abs/0709.0907 (2007) - [i1]Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties. CoRR abs/0711.1478 (2007) - 2003
- [c1]Olivier Bournez, Mathieu Hoyrup:
Rewriting Logic and Probabilities. RTA 2003: 61-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: