scientific article; zbMATH DE number 4119313

zbMath0683.60002MaRDI QIDQ4733163

A. Kh. Shen'

Publication date: 1989

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

zbMATH Keywords

algorithmic complexityalgorithmic concept of randomnessKolmogorov- Loveland stochastic sequence

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Related Items (15)

Computational depth and reducibility ⋮ Computational depth and reducibility ⋮ The dimensions of individual strings and sequences ⋮ Algorithmic randomness and monotone complexity on product space ⋮ Feasible reductions to Kolmogorov-Loveland stochastic sequences ⋮ On independent random oracles ⋮ The complexity of stochastic sequences ⋮ How powerful are integer-valued martingales? ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ Prediction and dimension ⋮ On a definition of random sequences with respect to conditional probability ⋮ Constructive equivalence relations on computable probability measures ⋮ The descriptive complexity of Brownian motion ⋮ Kolmogorov-Loveland randomness and stochasticity

This page was built for publication: