Patterns in numerical data: Practical approximations to Kolmogorov complexity

DOI10.1007/978-3-540-48061-7_62MaRDI QIDQ4950094zbMATH OpenFDO

Authors Tsau Young Lin

Publication date 7 May 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-48061-7_62

zbMATH Keywords

Kalmogorov complexity theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Approximating Kolmogorov complexity
• Statistical properties of finite sequences with high Kolmogorov complexity
• Pattern matching and lossy data compression on random fields
• On the complexity of some data analysis problems
• Analysis of discrete data: Rerandomization methods and complexity
• scientific article; zbMATH DE number 4086981
• Numerical Solutions for Patterns Statistics on Markov Chains

This page was built for publication: Patterns in numerical data: Practical approximations to Kolmogorov complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950094)