#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mathieu Hoyrup, Cristobal Rojas
- Inf. Comput.
- 2009

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable… (More)

- Mathieu Hoyrup, Cristobal Rojas
- CiE
- 2009

In this paper we provide a framework for computable analysis of measure, probability and integration theories. We work on computable metric spaces with computable Borel probability measures. We introduce and study the framework of layerwise computability which lies on Martin-Löf randomness and the existence of a universal randomness test. We then prove… (More)

- Péter Gács, Mathieu Hoyrup, Cristobal Rojas
- Theory of Computing Systems
- 2009

We extend the notion of randomness (in the version introduced by Schnorr) to computable probability spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the statistical behavior of the system (Birkhoff’s pointwise ergodic theorem). We prove that a point is Schnorr random if and… (More)

- Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
- CiE
- 2011

We show that computability of the Radon-Nikodym derivative of a measure μ absolutely continuous w.r.t. some other measure λ can be reduced to a single application of the non-computable operator EC, which transforms enumeration of sets (in N) to their characteristic functions. We also give a condition on the two measures (in terms of the computability of the… (More)

- Mathieu Hoyrup, Cristobal Rojas
- ICALP
- 2009

We pursue the study of the framework of layerwise computability introduced in [HR09a] and give three applications. (i) We prove a general version of Birkhoff’s ergodic theorem for random points, where the transformation and the observable are supposed to be effectively measurable instead of computable. This result significantly improves [V’y97, Nan08]. (ii)… (More)

This paper offers some new results on randomness with respect to classes of measures, along with a didactical exposition of their context based on results that appeared elsewhere. We start with the reformulation of the Martin-Löf definition of randomness (with respect to computable measures) in terms of randomness deficiency functions. A formula that… (More)

- Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
- Inf. Comput.
- 2010

We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that such points have typical statistical behavior (the behavior… (More)

- Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
- Theor. Comput. Sci.
- 2009

In 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… (More)

- Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas, Carlangelo Liverani
- 2009

We consider the question of computing invariant measures from an abstract point of view. Here, computing a measure means finding an algorithm which can output descriptions of the measure up to any precision. We work in a general framework (computable metric spaces) where this problem can be posed precisely. We will find invariant measures as fixed points of… (More)

- Cristobal Rojas
- Mathematical Structures in Computer Science
- 2008

This paper presents a short survey of some recent approaches relating different areas: deterministic chaos and computability. Chaos, in classical physics, may be approached by dynamical (equationally determined) systems or stochastic ones (as random processes). Now, randomness has also been effectively modeled with recursion theoretic tools by P.… (More)