On the algorithmic complexity of static structures

This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The system deforms the randomness of an input force sequence in proportion to its algorithmic complexity. The authors demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally-random force sequence (input). The level of complexity of the system is controlled via external parameters. The output response is the field of displacements observed at several positions on the body. The algorithmic complexity and stochasticity of the resulting output displacement sequence is measured and compared against the complexity of the system. The results show that the higher the system complexity, the more random-deficient the output sequence.

[1]  A. Kolmogorov Three approaches to the quantitative definition of information , 1968 .

[2]  Joel Ratsaby On the sysRatio and its critical point , 2011, Math. Comput. Model..

[3]  Joel Ratsaby An algorithmic complexity interpretation of Lin's third law of information theory , 2008, Entropy.

[4]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[5]  Joel Ratsaby,et al.  Prediction by Compression , 2010, ArXiv.

[6]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[7]  A. Church A Set of Postulates for the Foundation of Logic , 1932 .

[8]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[9]  Gregory J. Chaitin,et al.  Algorithmic Information Theory , 1987, IBM J. Res. Dev..

[10]  Moshe M. Barash,et al.  Complexity in manufacturing systems, Part 1: Analysis of static complexity , 1998 .

[11]  Vladimir V. V'yugin,et al.  Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences , 1999, Comput. J..

[12]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[13]  Joel Ratsaby Some Consequences of the Complexity of Intelligent Prediction , 2010 .

[14]  Joel Ratsaby On the randomness in learning , 2009, 2009 IEEE International Conference on Computational Cybernetics (ICCC).

[15]  E. Asarin Some Properties of Kolmogorov $\Delta$-Random Finite Sequences , 1988 .

[16]  Joel Ratsaby,et al.  An empirical study of the complexity and randomness of prediction error sequences , 2011 .

[17]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[18]  A. Shiryayev On Tables of Random Numbers , 1993 .