On the algorithmic complexity of static structures

DOI10.1007/s11424-010-8465-2zbMath1394.74061OpenAlexW1967055479MaRDI QIDQ545415

Joel Ratsaby, Joël Chaskalovic

Publication date: 22 June 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-010-8465-2

zbMATH Keywords

randomnessdescriptional complexitystatic structure

Mathematics Subject Classification ID

Vibrations in dynamical problems in solid mechanics (74H45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

An empirical study of the complexity and randomness of prediction error sequences

Cites Work

• An empirical study of the complexity and randomness of prediction error sequences
• On tables of random numbers
• Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
• A Theory of Program Size Formally Identical to Information Theory
• A universal algorithm for sequential data compression
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the algorithmic complexity of static structures