scientific article; zbMATH DE number 1390092

zbMath0945.68081MaRDI QIDQ4934359

Ludwig Staiger

Publication date: 17 January 2000

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

zbMATH Keywords

Kolmogorov complexities

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (6)

Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Computing a Glimpse of Randomness ⋮ Entropic measures, Markov information sources and complexity ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ Randomness on full shift spaces ⋮ Feasible analysis, randomness, and base invariance

This page was built for publication: