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
research
06/16/2019

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

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

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable se...
research
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...
research
08/14/2023

Exploring the abyss in Kleene's computability theory

Kleene's computability theory based on the S1-S9 computation schemes con...
research
02/14/2023

The non-normal abyss in Kleene's computability theory

Kleene's computability theory based on his S1-S9 computation schemes con...
research
08/18/2023

Canonicity and Computability in Homotopy Type Theory

This dissertation gives an overview of Martin Lof's dependant type theor...
research
12/13/2017

Decomposing the Univalence Axiom

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

Please sign up or login with your details

Forgot password? Click here to reset