Amanote Research

Amanote Research

    RegisterSign In

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

Problems of Information Transmission - Russian Federation
doi 10.1007/s11122-005-0028-0
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
Date

July 1, 2005

Authors
M. A. Ustinov
Publisher

Springer Science and Business Media LLC


Related search

A Conditional Kolmogorov Test

Econometrica
EconomicsEconometrics
1997English

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Conditioning Using Conditional Expectations: The Borel–Kolmogorov Paradox

Synthese
PhilosophySocial Sciences
2016English

Combinatorial Interpretation of Kolmogorov Complexity

English

A Strange Application of Kolmogorov Complexity

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1998English

Time-Bounded Kolmogorov Complexity and Solovay Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2000English

Absolute Stability, Conditional Stability and Bifurcation in Kolmogorov-Type Predator-Prey Systems With Discrete Delays

Quarterly of Applied Mathematics
Applied Mathematics
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy