scientific article; zbMATH DE number 3307567
From MaRDI portal
Publication:5588648
zbMath0193.31601MaRDI QIDQ5588648
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Randomness and reducibility ⋮ Computational depth and reducibility ⋮ Computational depth and reducibility ⋮ On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line ⋮ Time-Bounded Kolmogorov Complexity and Solovay Functions ⋮ Weakly useful sequences ⋮ Geometry of the space of triangulations of a compact manifold ⋮ Universal computably enumerable sets and initial segment prefix-free complexity ⋮ Unnamed Item ⋮ Time-bounded Kolmogorov complexity and Solovay functions ⋮ Minimal-program complexity of pseudo-recursive and pseudo-random sequences ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ Algorithmic complexity of recursive and inductive algorithms ⋮ On the Amount of Nonconstructivity in Learning Recursive Functions ⋮ Kobayashi compressibility ⋮ The extent and density of sequences within the minimal-program complexity hierarchies ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Weakly useful sequences ⋮ Time-bounded incompressibility of compressible strings and sequences ⋮ On the inference of optimal descriptions ⋮ On the amount of nonconstructivity in learning formal languages from text ⋮ Dimension extractors and optimal decompression ⋮ Amount of Nonconstructivity in Finite Automata ⋮ On the relation between descriptional complexity and algorithmic probability
This page was built for publication:
