Mathieu Hoyrup

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Degree spectra of homeomorphism types of compact Polish spaces
(available as arXiv preprint)
N/APaper
Degree spectra of homeomorphism type of compact Polish spaces
The Journal of Symbolic Logic
2026-06-12Paper
Descriptive complexity on non-Polish spaces. II2026-03-18Paper
Local generation of tilings
Ergodic Theory and Dynamical Systems
2025-10-14Paper
Descriptive complexity of topological invariants
Annals of Pure and Applied Logic
2025-06-18Paper
Comparing computability in two topologies
Journal of Symbolic Logic
2024-11-25Paper
The surjection property and computable type
Topology and its Applications
2024-08-23Paper
Computability of finite simplicial complexes2024-06-24Paper
Notes on overt choice
Computability
2024-01-31Paper
Strong computable type
Computability
2023-11-30Paper
The surjection property and computable type2023-06-26Paper
Descriptive complexity on non-Polish spaces2023-02-07Paper
Degrees of non-computability of homeomorphism types of Polish spaces2022-12-16Paper
Realizing semicomputable simplices by computable dynamical systems
Theoretical Computer Science
2022-09-27Paper
Semicomputable points in Euclidean spaces2022-07-21Paper
The fixed-point property for represented spaces
Annals of Pure and Applied Logic
2022-04-01Paper
Computability of finite simplicial complexes2022-02-10Paper
Computable Measure Theory and Algorithmic Randomness
Theory and Applications of Computability
2022-01-26Paper
scientific article; zbMATH DE number 7376056 (Why is no real title available?)2021-07-28Paper
scientific article; zbMATH DE number 7311149 (Why is no real title available?)2021-02-16Paper
On the extension of computable real functions2021-01-19Paper
Computability on quasi-Polish spaces
(available as arXiv preprint)
2020-05-12Paper
Topological analysis of representations2018-09-06Paper
On the information carried by programs about the objects they compute
Theory of Computing Systems
2018-02-01Paper
Layerwise computability and image randomness
Theory of Computing Systems
2018-02-01Paper
The decidable properties of subrecursive functions2017-12-19Paper
Results in descriptive set theory on some represented spaces2017-12-11Paper
Genericity of weakly computable objects
Theory of Computing Systems
2017-07-17Paper
On the query complexity of real functionals
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2017-07-03Paper
scientific article; zbMATH DE number 6691416 (Why is no real title available?)2017-03-03Paper
On the information carried by programs about the objects they compute
(available as arXiv preprint)
2017-01-24Paper
The typical constructible object
Pursuit of the Universal
2016-08-17Paper
Immune Systems in Computer Virology
Evolving Computability
2015-10-20Paper
Characterizing polynomial time complexity of stream programs using interpretations
Theoretical Computer Science
2015-05-26Paper
Algorithmic tests and randomness with respect to a class of measures
Proceedings of the Steklov Institute of Mathematics
2014-08-04Paper
Analytical properties of resource-bounded real functionals
Journal of Complexity
2014-07-31Paper
Statistical properties of dynamical systems -- Simulation and abstract computation
Chaos, Solitons and Fractals
2013-08-07Paper
Computability of the ergodic decomposition
Annals of Pure and Applied Logic
2013-04-05Paper
Computability of the Radon-Nikodym derivative
Computability
2013-01-30Paper
The dimension of ergodic random sequences
(available as arXiv preprint)
2012-08-23Paper
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation
2012-05-24Paper
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation
2012-05-24Paper
Randomness on computable probability spaces -- a dynamical point of view2012-04-24Paper
Randomness and the ergodic decomposition
Models of Computation in Context
2011-09-09Paper
Computability of the Radon-Nikodym derivative
Lecture Notes in Computer Science
2011-09-09Paper
Randomness on computable probability spaces -- a dynamical point of view
Theory of Computing Systems
2011-05-23Paper
Dynamics and abstract computability: computing invariant measures
Discrete and Continuous Dynamical Systems
2011-03-07Paper
Interpretation of stream programs: characterizing type 2 polynomial time complexity
Algorithms and Computation
2010-12-09Paper
An application of Martin-Löf randomness to effective probability theory
Mathematical Theory and Computational Practice
2010-07-28Paper
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation
2010-01-12Paper
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
2009-07-15Paper
Applications of Effective Probability Theory to Martin-Löf Randomness
Automata, Languages and Programming
2009-07-14Paper
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Theoretical Computer Science
2009-05-28Paper
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science
2008-06-24Paper
Computability of probability measures and Martin-Lof randomness over metric spaces
(available as arXiv preprint)
2007-09-06Paper
Dynamical systems: stability and simulability
Mathematical Structures in Computer Science
2007-06-04Paper
scientific article; zbMATH DE number 2043521 (Why is no real title available?)2004-02-16Paper


Research outcomes over time


This page was built for person: Mathieu Hoyrup