scientific article; zbMATH DE number 3637728

MaRDI QIDQ4198620zbMATH OpenFDO

Authors Leonid A. Levin, Vladimir V. V'yugin

Publication date 1977

zbMATH Keywords

Algorithmic Theory of InformationComputable OperatorsInfinite Sequences of Natural NumbersIntuitionismInvariant Properties of Informational BulksRecursive Enumerable MeasureStochastic Process

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03D99) Intuitionistic mathematics (03F55) Stochastic processes (60G99) Algorithms in computer science (68W99) Measures of information, entropy (94A17) Communication, information (94A99)

Cited in

(10)

• Non-stochastic infinite and finite sequences
• Computational depth and reducibility
• Absolutely no free lunches!
• Computational depth and reducibility
• Degrees of randomized computability
• Diagonally non-computable functions and fireworks
• Deep _1⁰ classes
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• Dimensionality and randomness
• On an open question regarding atoms in the Levin-V'yugin degrees

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 Q4198620)