English

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

Numerical Analysis 2019-06-18 v1 Logic in Computer Science Numerical Analysis

Abstract

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\"oder&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\'e'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.

Keywords

Cite

@article{arxiv.1906.06684,
  title  = {Randomized Computation of Continuous Data: Is Brownian Motion Computable?},
  author = {Willem Fouché and Hyunwoo Lee and Donghyun Lim and Sewon Park and Matthias Schröder and Martin Ziegler},
  journal= {arXiv preprint arXiv:1906.06684},
  year   = {2019}
}

Comments

9 pages

R2 v1 2026-06-23T09:54:51.188Z