DeepAI AI Chat
Log In Sign Up

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

by   Willem Fouché, et al.

We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as sample space the Cantor space of infinite FAIR coin flips. This extends [Schröder&Simpson'05] and [Hoyrup&Rojas'09] considering sequences of suitably and adaptively BIASED coins. Our second contribution is concerned with 1D Brownian Motion (aka Wiener Process), a probability distribution on the space of continuous functions f:[0,1]->R with f(0)=0 whose computability has been conjectured [Davie&Fouché'13; arXiv:1409.4667,S6]. We establish that this (higher-type) random variable is computable iff some/every computable family of moduli of continuity (as ordinary random variables) has a computable probability distribution with respect to the Wiener Measure.


page 1

page 2

page 3

page 4


Computable Random Variables and Conditioning

The aim of this paper is to present an elementary computable theory of r...

On the computability of graphons

We investigate the relative computability of exchangeable binary relatio...

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable se...

Continuous and monotone machines

We investigate a variant of the fuel-based approach to modeling divergin...

Local time of Martin-Lof Brownian motion

In this paper we study the local times of Brownian motion from the point...

Stable Conformal Prediction Sets

When one observes a sequence of variables (x_1, y_1), ..., (x_n, y_n), c...

Identification of Probabilities

Within psychology, neuroscience and artificial intelligence, there has b...