Computable Measure Theory and Algorithmic Randomness (Q5024573)

scientific article; zbMATH DE number 7464645

Language	Label	Description	Also known as
English	Computable Measure Theory and Algorithmic Randomness	scientific article; zbMATH DE number 7464645

Statements

instance of

scholarly article

0 references

title

Computable Measure Theory and Algorithmic Randomness (English)

0 references

0 references

0 references

Theory and Applications of Computability

0 references

publication date

26 January 2022

0 references

full work available at URL

https://hal.inria.fr/hal-02938919/file/Chapter_HR.pdf

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On computability and disintegration

0 references

On zeros of Martin-Löf random Brownian motion

0 references

Q3505880

0 references

Use of the Kolmogorov complexity in analyzing control system dynamics

0 references

Uncomputably noisy ergodic limits

0 references

Algorithmic randomness, reverse mathematics, and the dominated convergence theorem

0 references

Local stability of ergodic averages

0 references

MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS

0 references

Algorithmic Randomness of Closed Sets

0 references

Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness

0 references

An example of a computable absolutely normal number

0 references

Ergodic-Type Characterizations of Algorithmic Randomness

0 references

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points

0 references

Algorithmic tests and randomness with respect to a class of measures

0 references

Effective Randomness for Computable Probability Measures

0 references

Von Neumann's Biased Coin Revisited

0 references

Q5573965

0 references

Are unbounded linear operators computable on the average for Gaussian measures?

0 references

Q3518440

0 references

Las Vegas Computability and Algorithmic Randomness

0 references

Probabilistic computability and choice

0 references

Randomness and differentiability

0 references

Introduction to Dynamical Systems

0 references

Random Continuous Functions

0 references

The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity

0 references

On the computability of a construction of Brownian motion

0 references

Q4088797

0 references

Members of Random Closed Sets

0 references

Q4283467

0 references

Algorithmic Randomness and Complexity

0 references

A computable approach to measure and integration theory

0 references

Arithmetical representations of Brownian motion I

0 references

The descriptive complexity of Brownian motion

0 references

Dynamics of a generic Brownian motion: Recursive aspects

0 references

Fractals Generated by Algorithmically Random Brownian Motion

0 references

Q4982346

0 references

Kolmogorov complexity and the geometry of Brownian motion

0 references

Fourier spectra of measures associated with algorithmically random Brownian motion

0 references

Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets

0 references

Randomness and Non-ergodic Systems

0 references

Algorithmic Aspects of Lipschitz Functions

0 references

Computable Exchangeable Sequences Have Computable de Finetti Measures

0 references

Computable de Finetti measures

0 references

The computational complexity of maximization and integration

0 references

Uniform test of algorithmic randomness over a general space

0 references

Randomness on computable probability spaces - A dynamical point of view

0 references

Randomness on computable probability spaces -- a dynamical point of view

0 references

A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties

0 references

Q5150971

0 references

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

0 references

Dynamics and abstract computability: computing invariant measures

0 references

Statistical properties of dynamical systems -- Simulation and abstract computation

0 references

Q4520525

0 references

Q4219053

0 references

Random elements in effective topological spaces with measure.

0 references

Upcrossing inequalities for stationary sequences and applications

0 references

Universality, optimality, and randomness deficiency

0 references

Randomness and the Ergodic Decomposition

0 references

The dimension of ergodic random sequences

0 references

Computability of the ergodic decomposition

0 references

Q2965498

0 references

An Application of Martin-Löf Randomness to Effective Probability Theory

0 references

Applications of Effective Probability Theory to Martin-Löf Randomness

0 references

Computability of probability measures and Martin-Löf randomness over metric spaces

0 references

Computability of the Radon-Nikodym Derivative

0 references

Q5377577

0 references

The speed of convergence in the ergodic theorem

0 references

Complexity Theory for Operators in Analysis

0 references

Infinite subsets of random sets of integers

0 references

The probability distribution as a computational resource for randomness testing

0 references

The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

0 references

Algorithmic randomness for Doob's martingale convergence theorem in continuous time

0 references

Q4002474

0 references

Von Mises' definition of random sequences reconsidered

0 references

Q4109577

0 references

An introduction to Kolmogorov complexity and its applications

0 references

Computable Riesz representation for the dual of <i>C</i> [0; 1]

0 references

Q3518434

0 references

The definition of random sequences

0 references

The difference between optimality and universality

0 references

L1-Computability, Layerwise Computability and Solovay Reducibility

0 references

Algorithmic randomness over general spaces

0 references

USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS

0 references

Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness

0 references

On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions

0 references

Computability on random variables

0 references

Q3549680

0 references

Q3611832

0 references

Differentiability of polynomial time computable functions

0 references

Schnorr randomness and the Lebesgue differentiation theorem

0 references

Q5508589

0 references

L p -Computability in Recursive Analysis

0 references

Q3994907

0 references

Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma

0 references

Computable randomness and betting for computable probability spaces

0 references

When does randomness come from randomness?

0 references

Schnorr randomness for noncomputable measures

0 references

Q5556429

0 references

Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

0 references

Admissible representations for probability measures

0 references

A constructive view on ergodic theorems

0 references

On a definition of random sequences with respect to conditional probability

0 references

Algorithmic randomness and monotone complexity on product space

0 references

The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences

0 references

Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей

0 references

Ergodic theorems for individual random sequences

0 references

Nonrobustness property of the individual ergodic theorem

0 references

Computability on the probability measures on the Borel sets of the unit interval

0 references

Q4485693

0 references

Q4531998

0 references

Computability on measurable functions

0 references

Representations of measurable sets in computable measure theory

0 references

Computability of measurable sets via effective topologies

0 references

A computable version of the Daniell-Stone theorem on integration and linear functionals

0 references

L<sup>p</sup>‐Computability

0 references

Identifiers

DOI

10.1007/978-3-030-59234-9_7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5024573