scientific article
From MaRDI portal
Publication:4070739
zbMath0312.94007MaRDI QIDQ4070739
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philosophical and critical aspects of logic and foundations (03A05) Information theory (general) (94A15) Computability and recursion theory (03D99) Axioms; other general questions in probability (60A05)
Related Items
Randomness and reducibility ⋮ Relating and contrasting plain and prefix Kolmogorov complexity ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Chaitin's omega and an algorithmic phase transition ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ A computable measure of algorithmic probability by finite approximations with an application to integer sequences ⋮ Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs ⋮ Randomness for computable measures and initial segment complexity ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ Program size complexity for possibly infinite computations ⋮ On the computational power of random strings ⋮ Bounded Turing reductions and data processing inequalities for sequences ⋮ Martin-Löf random quantum states ⋮ Solomonoff Induction Violates Nicod’s Criterion ⋮ A Church-Turing thesis for randomness?