AbstractIn the general context of computable metric spaces and computable measures we prove a kind of constructive Borel–Cantelli lemma: given a sequence (constructive in some way) of sets Ai with effectively summable measures, there are computable points which are not contained in infinitely many Ai.As a consequence of this we obtain the existence of computable points which follow the typical statistical behavior of a dynamical system (they satisfy the Birkhoff theorem) for a large class of systems, having computable invariant measure and a certain “logarithmic” speed of convergence of Birkhoff averages over Lipschitz observables. This is applied to uniformly hyperbolic systems, piecewise expanding maps, systems on the interval with an ind...
AbstractFor every metric space X, we define a continuous poset BX such that X is homeomorphic to the...
Abstract. Let (An)∞n=1 be a sequence of sets in a probability space (X,B, µ) such that P∞ n=1 µ(An) ...
DL'objectif général de cette thèse est d'étudier les notions d'aléatoire et d'information algorithmi...
Abstract. In the general context of computable metric spaces and com-putable measures we prove a kin...
AbstractIn the general context of computable metric spaces and computable measures we prove a kind o...
We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spa...
We consider the question of computing invariant measures from an abstract point of view. Here, compu...
We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spac...
AbstractWe consider the dynamical behavior of Martin-Löf random points in dynamical systems over met...
AbstractWhile computability theory on many countable sets is well established and for computability ...
Abstract. Let (Bi) be a sequence of measurable sets in a probability space (X,B, µ) such that ∑∞n=1 ...
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
20 pagesInternational audienceLet $(B_{i})$ be a sequence of measurable sets in a probability space ...
International audienceWe consider the question of computing invariant measures from an abstract poin...
International audienceA pseudorandom point in an ergodic dynamical system over a computable metric s...
AbstractFor every metric space X, we define a continuous poset BX such that X is homeomorphic to the...
Abstract. Let (An)∞n=1 be a sequence of sets in a probability space (X,B, µ) such that P∞ n=1 µ(An) ...
DL'objectif général de cette thèse est d'étudier les notions d'aléatoire et d'information algorithmi...
Abstract. In the general context of computable metric spaces and com-putable measures we prove a kin...
AbstractIn the general context of computable metric spaces and computable measures we prove a kind o...
We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spa...
We consider the question of computing invariant measures from an abstract point of view. Here, compu...
We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spac...
AbstractWe consider the dynamical behavior of Martin-Löf random points in dynamical systems over met...
AbstractWhile computability theory on many countable sets is well established and for computability ...
Abstract. Let (Bi) be a sequence of measurable sets in a probability space (X,B, µ) such that ∑∞n=1 ...
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
20 pagesInternational audienceLet $(B_{i})$ be a sequence of measurable sets in a probability space ...
International audienceWe consider the question of computing invariant measures from an abstract poin...
International audienceA pseudorandom point in an ergodic dynamical system over a computable metric s...
AbstractFor every metric space X, we define a continuous poset BX such that X is homeomorphic to the...
Abstract. Let (An)∞n=1 be a sequence of sets in a probability space (X,B, µ) such that P∞ n=1 µ(An) ...
DL'objectif général de cette thèse est d'étudier les notions d'aléatoire et d'information algorithmi...