Computable Measure Theory and Algorithmic Randomness
From MaRDI portal
(Redirected from Publication:5024573)
Recommendations
- Computability, algorithmic randomness and complexity
- scientific article; zbMATH DE number 1531917
- scientific article; zbMATH DE number 5057386
- Algorithmic randomness and measures of complexity
- On elementary computability-theoretic properties of algorithmic randomness
- Randomness for computable measures and initial segment complexity
- Computability and Randomness
- Computability and randomness
- Randomness extraction in computability theory
Cites work
- L^1-computability, layerwise computability and Solovay reducibility
- A computable approach to measure and integration theory
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- A constructive view on ergodic theorems
- Admissible representations for probability measures
- Algorithmic aspects of Lipschitz functions
- Algorithmic randomness and complexity.
- Algorithmic randomness and monotone complexity on product space
- Algorithmic randomness for Doob's martingale convergence theorem in continuous time
- Algorithmic Randomness of Closed Sets
- Algorithmic randomness over general spaces
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Algorithmic tests and randomness with respect to a class of measures
- An application of Martin-Löf randomness to effective probability theory
- An example of a computable absolutely normal number
- An introduction to Kolmogorov complexity and its applications
- Applications of Effective Probability Theory to Martin-Löf Randomness
- Are unbounded linear operators computable on the average for Gaussian measures?
- Arithmetical representations of Brownian motion I
- Complexity theory for operators in analysis
- Computability and randomness
- Computability of measurable sets via effective topologies
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computability of the ergodic decomposition
- Computability on measurable functions
- Computability on random variables
- Computability on the probability measures on the Borel sets of the unit interval
- Computable de Finetti measures
- Computable exchangeable sequences have computable de Finetti measures
- Computable randomness and betting for computable probability spaces
- Computable Riesz representation for locally compact Hausdorff spaces
- Computable Riesz representation for the dual of C [0; 1]
- Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
- Differentiability of polynomial time computable functions
- Diophantine properties of Brownian motion: recursive aspects
- Dynamics and abstract computability: computing invariant measures
- Dynamics of a generic Brownian motion: Recursive aspects
- Effective randomness for computable probability measures
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Ergodic theorems for individual random sequences
- Ergodic-Type Characterizations of Algorithmic Randomness
- Fourier spectra of measures associated with algorithmically random Brownian motion
- Fractals generated by algorithmically random Brownian motion
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
- scientific article; zbMATH DE number 5287418 (Why is no real title available?)
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- scientific article; zbMATH DE number 5485513 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3508473 (Why is no real title available?)
- scientific article; zbMATH DE number 3532844 (Why is no real title available?)
- scientific article; zbMATH DE number 1223737 (Why is no real title available?)
- scientific article; zbMATH DE number 515978 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1543069 (Why is no real title available?)
- scientific article; zbMATH DE number 1746049 (Why is no real title available?)
- scientific article; zbMATH DE number 7311149 (Why is no real title available?)
- scientific article; zbMATH DE number 7059097 (Why is no real title available?)
- scientific article; zbMATH DE number 3219970 (Why is no real title available?)
- scientific article; zbMATH DE number 3271504 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- Infinite subsets of random sets of integers
- Introduction to Dynamical Systems
- Kolmogorov complexity and the geometry of Brownian motion
- L p -Computability in Recursive Analysis
- Lp‐Computability
- Las Vegas computability and algorithmic randomness
- Local stability of ergodic averages
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- Martin-Löf randomness in spaces of closed sets
- Members of Random Closed Sets
- Nonrobustness property of the individual ergodic theorem
- On a definition of random sequences with respect to conditional probability
- On computability and disintegration
- On the computability of a construction of Brownian motion
- On the convergence of Fourier series of computable Lebesgue integrable functions
- On zeros of Martin-Löf random Brownian motion
- Probabilistic computability and choice
- Probabilistic constructions of computable objects and a computable version of Lovász local lemma
- Random Continuous Functions
- Random elements in effective topological spaces with measure.
- Randomness and differentiability
- Randomness and non-ergodic systems
- Randomness and the ergodic decomposition
- Randomness on computable probability spaces -- a dynamical point of view
- Randomness on computable probability spaces -- a dynamical point of view
- Representations of measurable sets in computable measure theory
- Schnorr randomness and the Lebesgue differentiation theorem
- Schnorr randomness for noncomputable measures
- Statistical properties of dynamical systems -- Simulation and abstract computation
- The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
- The computational complexity of maximization and integration
- The definition of random sequences
- The descriptive complexity of Brownian motion
- The difference between optimality and universality
- The dimension of ergodic random sequences
- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- The probability distribution as a computational resource for randomness testing
- The speed of convergence in the ergodic theorem
- Uncomputably noisy ergodic limits
- Uniform test of algorithmic randomness over a general space
- Universality, optimality, and randomness deficiency
- Upcrossing inequalities for stationary sequences and applications
- Use of the Kolmogorov complexity in analyzing control system dynamics
- Using almost-everywhere theorems from analysis to study randomness
- Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
- Von Mises' definition of random sequences reconsidered
- Von Neumann's biased coin revisited
- When does randomness come from randomness?
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
Cited in
(18)- Algorithmic tests and randomness with respect to a class of measures
- Randomness for non-computable measures
- Lowness, Randomness, and Computable Analysis
- Computational Randomness from Generalized Hardcore Sets
- A relation between correctness and randomness in the computation of probabilistic algorithms
- Ergodic-Type Characterizations of Algorithmic Randomness
- scientific article; zbMATH DE number 1347865 (Why is no real title available?)
- scientific article; zbMATH DE number 1163978 (Why is no real title available?)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Effective Brenier Theorem
- Structure and Randomness in Computability and Set Theory
- A measure-theoretic proof of Turing incomparability
- Computer Science for Continuous Data
- Unprincipled
- Generalized learnability of stochastic principles
- Computation with real numbers and continuous-time dynamical systems
- On quantitative convergence for stochastic processes: crossings, fluctuations and martingales
- Algorithmic randomness and the weak merging of computable probability measures
This page was built for publication: Computable Measure Theory and Algorithmic Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024573)
