Amanote Research

Amanote Research

    RegisterSign In

A Strange Application of Kolmogorov Complexity

Theory of Computing Systems - United States
doi 10.1007/s002240000038
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational TheoryTheoretical Computer ScienceMathematics
Date

February 1, 1998

Authors
D. HammerA. Shen
Publisher

Springer Science and Business Media LLC


Related search

Combinatorial Interpretation of Kolmogorov Complexity

English

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

Problems of Information Transmission
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2005English

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

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

A Conditional Kolmogorov Test

Econometrica
EconomicsEconometrics
1997English

“A Strange Catalogue of Things”

Nexus Network Journal
Visual ArtsPerforming ArtsArchitectureMathematics
2010English

Remembering Kolmogorov

Metascience
Philosophy of ScienceSocial SciencesHistory
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy