DeepAI
Log In Sign Up

Computable Random Variables and Conditioning

12/22/2020
by   Pieter Collins, et al.
0

The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets, and extends existing work in this area by providing a computable theory of conditional random variables. The theory is based within the framework of type-two effectivity, so has an explicit direct link with Turing computation, and is expressed in a system of computable types and operations, so has a clean mathematical description.

READ FULL TEXT
06/16/2019

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

We consider randomized computation of continuous data in the sense of Co...
12/06/2009

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable se...
05/22/2018

Computable Variants of AIXI which are More Powerful than AIXItl

This paper presents Unlimited Computable AI, or UCAI, that is a family o...
10/13/2011

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modelin...
06/05/2021

The basic distributional theory for the product of zero mean correlated normal random variables

The product of two zero mean correlated normal random variables has rece...
06/28/2022

Computation as uncertainty reduction: a simplified order-theoretic framework

Although there is a somewhat standard formalization of computability on ...
12/13/2017

Decomposing the Univalence Axiom

This paper investigates the univalence axiom in intensional Martin-Löf t...