scientific article; zbMATH DE number 3541937

zbMath0347.68035MaRDI QIDQ4117381

Leonid A. Levin

Publication date: 1976

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15)

Related Items (17)

Randomness and reducibility ⋮ A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ Computational depth and reducibility ⋮ Relating and contrasting plain and prefix Kolmogorov complexity ⋮ Computational depth and reducibility ⋮ Non-Algorithmic Theory of Randomness ⋮ Unnamed Item ⋮ Error-correcting codes and neural networks ⋮ Martingales in the Study of Randomness ⋮ Relations between varieties of kolmogorov complexities ⋮ Schnorr Randomness ⋮ Trivial Reals ⋮ Zipf's law and L. Levin probability distributions ⋮ Informational branching universe ⋮ Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets ⋮ Kolmogorov complexity and non-determinism ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice

This page was built for publication: