Bounds on the Kolmogorov Complexity Function for Infinite Words

doi 10.1142/9789813109032_0008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

WORLD SCIENTIFIC

Related search

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

Problems of Information Transmission
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2005English

Temperature Bounds on the Infinite Rod

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1952English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Combinatorial Interpretation of Kolmogorov Complexity

English

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

A Strange Application of Kolmogorov Complexity

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy