Mathieu Hoyrup

From MaRDI portal
Person:418116

Available identifiers

zbMath Open hoyrup.mathieuMaRDI QIDQ418116

List of research outcomes





PublicationDate of PublicationType
Comparing computability in two topologies2024-11-25Paper
The surjection property and computable type2024-08-23Paper
Computability of finite simplicial complexes2024-06-24Paper
Notes on overt choice2024-01-31Paper
Strong computable type2023-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 systems2022-09-27Paper
https://portal.mardi4nfdi.de/entity/Q50924102022-07-21Paper
The fixed-point property for represented spaces2022-04-01Paper
Computability of finite simplicial complexes2022-02-10Paper
Computable Measure Theory and Algorithmic Randomness2022-01-26Paper
https://portal.mardi4nfdi.de/entity/Q50028162021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51509712021-02-16Paper
https://portal.mardi4nfdi.de/entity/Q51446132021-01-19Paper
Computability on quasi-Polish spaces2020-05-12Paper
Topological analysis of representations2018-09-06Paper
Layerwise computability and image randomness2018-02-01Paper
On the information carried by programs about the objects they compute2018-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 objects2017-07-17Paper
On the Query Complexity of Real Functionals2017-07-03Paper
https://portal.mardi4nfdi.de/entity/Q29654982017-03-03Paper
https://portal.mardi4nfdi.de/entity/Q29550152017-01-24Paper
The Typical Constructible Object2016-08-17Paper
Immune Systems in Computer Virology2015-10-20Paper
Characterizing polynomial time complexity of stream programs using interpretations2015-05-26Paper
Algorithmic tests and randomness with respect to a class of measures2014-08-04Paper
Analytical properties of resource-bounded real functionals2014-07-31Paper
Statistical properties of dynamical systems -- Simulation and abstract computation2013-08-07Paper
Computability of the ergodic decomposition2013-04-05Paper
Computability of the Radon-Nikodym Derivative2013-01-30Paper
The dimension of ergodic random sequences2012-08-23Paper
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points2012-05-24Paper
Randomness on computable probability spaces - A dynamical point of view2012-04-24Paper
Randomness and the Ergodic Decomposition2011-09-09Paper
Computability of the Radon-Nikodym Derivative2011-09-09Paper
Randomness on computable probability spaces -- a dynamical point of view2011-05-23Paper
Dynamics and abstract computability: computing invariant measures2011-03-07Paper
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity2010-12-09Paper
An Application of Martin-Löf Randomness to Effective Probability Theory2010-07-28Paper
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy2010-01-12Paper
Computability of probability measures and Martin-Löf randomness over metric spaces2009-07-15Paper
Applications of Effective Probability Theory to Martin-Löf Randomness2009-07-14Paper
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties2009-05-28Paper
Computability and the morphological complexity of some dynamics on continuous domains2008-06-24Paper
Computability of probability measures and Martin-Lof randomness over metric spaces2007-09-06Paper
Dynamical systems: stability and simulability2007-06-04Paper
https://portal.mardi4nfdi.de/entity/Q44472232004-02-16Paper
Degree spectra of homeomorphism types of compact Polish spacesN/APaper

Research outcomes over time

This page was built for person: Mathieu Hoyrup