scientific article; zbMATH DE number 3489017

MaRDI QIDQ4070739zbMATH OpenFDO

Authors Leonid A. Levin

Publication date 1974

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Computability and recursion theory (03D99) Axioms; other general questions in probability (60A05) Information theory (general) (94A15)

Cited in

(22)

• 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
• Bounded Turing reductions and data processing inequalities for sequences
• Randomness and reducibility
• A Church-Turing thesis for randomness?
• On the computational power of random strings
• Strong jump-traceability. I: The computably enumerable case
• Chaitin's omega and an algorithmic phase transition
• Solomonoff induction violates Nicod's criterion
• Relating and contrasting plain and prefix Kolmogorov complexity
• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
• Degrees of randomized computability
• Randomness for computable measures and initial segment complexity
• Martin-Löf random quantum states
• Program size complexity for possibly infinite computations
• Simplicity bias, algorithmic probability, and the random logistic map
• Algorithmically optimal outer measures
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• One-way functions and pKt complexity
• Lower bounds for Levin-Kolmogorov complexity
• An efficient coding theorem via probabilistic representations and its applications
• Curious coincidences and Kolmogorov complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070739)