scientific article
From MaRDI portal
Publication:3434496
zbMath1116.03038MaRDI QIDQ3434496
Publication date: 2 May 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Related Items (15)
Energy randomness ⋮ On Oscillation-Free Chaitin h-Random Sequences ⋮ Phase Transition between Unidirectionality and Bidirectionality ⋮ Partial Randomness and Dimension of Recursively Enumerable Reals ⋮ Propagation of partial randomness ⋮ Fixed point theorems on partial randomness ⋮ Exact constructive and computable dimensions ⋮ Algorithmic information theory and its statistical mechanical interpretation ⋮ Subcomputable Hausdorff function dimension ⋮ On Oscillation-free ε-random Sequences ⋮ Representation of left-computable \(\varepsilon \)-random reals ⋮ Fixed Point Theorems on Partial Randomness ⋮ Searching for shortest and least programs ⋮ Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension ⋮ Symbolic dynamics: entropy = dimension = complexity
This page was built for publication:
