The following pages link to Mathieu Hoyrup (Q418116):
Displaying 47 items.
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- Randomness on computable probability spaces -- a dynamical point of view (Q537913) (← links)
- Dynamics and abstract computability: computing invariant measures (Q628764) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties (Q1019738) (← links)
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q1049402) (← links)
- Topological analysis of representations (Q1670742) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- Layerwise computability and image randomness (Q1694009) (← links)
- Computability of the ergodic decomposition (Q1944330) (← links)
- Degrees of non-computability of homeomorphism types of Polish spaces (Q2106604) (← links)
- The fixed-point property for represented spaces (Q2120973) (← links)
- Computability on quasi-Polish spaces (Q2179336) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Genericity of weakly computable objects (Q2363959) (← links)
- Computability of probability measures and Martin-Löf randomness over metric spaces (Q2389335) (← links)
- Statistical properties of dynamical systems -- Simulation and abstract computation (Q2393223) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Realizing semicomputable simplices by computable dynamical systems (Q2676461) (← links)
- The dimension of ergodic random sequences (Q2904794) (← links)
- (Q2955015) (← links)
- (Q2965498) (← links)
- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity (Q3060741) (← links)
- Randomness and the Ergodic Decomposition (Q3091447) (← links)
- Computability of the Radon-Nikodym Derivative (Q3091448) (← links)
- The Typical Constructible Object (Q3188247) (← links)
- Immune Systems in Computer Virology (Q3195689) (← links)
- Dynamical systems: stability and simulability (Q3444639) (← links)
- An Application of Martin-Löf Randomness to Effective Probability Theory (Q3576058) (← links)
- Applications of Effective Probability Theory to Martin-Löf Randomness (Q3638062) (← links)
- (Q4447223) (← links)
- The decidable properties of subrecursive functions (Q4598249) (← links)
- (Q5002816) (← links)
- Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
- (Q5092410) (← links)
- (Q5144613) (← links)
- (Q5150971) (← links)
- On the Query Complexity of Real Functionals (Q5271045) (← links)
- Randomness on computable probability spaces - A dynamical point of view (Q5390000) (← links)
- Descriptive complexity on non-Polish spaces (Q5874279) (← links)
- Strong computable type (Q6062176) (← links)
- Notes on overt choice (Q6146824) (← links)
- Degree spectra of homeomorphism types of compact Polish spaces (Q6503959) (← links)
- Computability of finite simplicial complexes (Q6560910) (← links)
- The surjection property and computable type (Q6592027) (← links)
- Comparing computability in two topologies (Q6642884) (← links)
