scientific article; zbMATH DE number 6876261

DOI10.23638/LMCS-14(2:11)2018zbMath1459.03069arXiv1505.02091MaRDI QIDQ4643953

George Davie, Arno Pauly, Willem L. Fouché

Publication date: 30 May 2018

Full work available at URL: https://arxiv.org/abs/1505.02091

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomnesscomputable analysisWeihrauch reducibilitylayerwise computability

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (7)

Computability of convergence rates in the ergodic theorem for Martin-Löf random points ⋮ Comparing representations for function spaces in computable analysis ⋮ Reduction games, provability and compactness ⋮ A topological view on algebraic computation models ⋮ Pointwise complexity of the derivative of a computable function ⋮ Representations of Analytic Functions and Weihrauch Degrees ⋮ Universality, optimality, and randomness deficiency

Cites Work

• Unnamed Item
• Unnamed Item
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• Closed choice and a uniform low basis theorem
• A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
• Use of the Kolmogorov complexity in analyzing control system dynamics
• The descriptive complexity of Brownian motion
• A topological view on algebraic computation models
• Algorithmically random series and Brownian motion
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• Universality, optimality, and randomness deficiency
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Dynamics of a generic Brownian motion: Recursive aspects
• A computable version of the random signs problem and Kolmogorov complexity
• Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
• The difference between optimality and universality
• The Vitali Covering Theorem in the Weihrauch Lattice
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Random Harmonic Series
• An Application of Martin-Löf Randomness to Effective Probability Theory
• Applications of Effective Probability Theory to Martin-Löf Randomness
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
• On the algebraic structure of Weihrauch degrees
• Descriptive Set Theory in the Category of Represented Spaces
• The degree structure of Weihrauch-reducibility
• Admissible representations for probability measures
• On the computability of a construction of Brownian motion
• The definition of random sequences

This page was built for publication: