ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES

被引:3
|
作者
Ratsaby, Joel [1 ]
Chaskalovic, J. [2 ,3 ]
机构
[1] Ariel Univ, Ctr Samaria, Dept Elect & Elect Engn, Ariel, Israel
[2] Ariel Univ, Ctr Samaria, Dept Math, Ariel, Israel
[3] Univ Paris 06, IJLRDA, F-75252 Paris 05, France
关键词
Data compression; descriptional complexity; randomness; static structure; INFORMATION-THEORY;
D O I
10.1007/s11424-010-8465-2
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:1037 / 1053
页数:17
相关论文
共 50 条
  • [1] On the algorithmic complexity of static structures
    Joel Ratsaby
    J. Chaskalovic
    Journal of Systems Science and Complexity, 2010, 23 : 1037 - 1053
  • [2] Algorithmic complexity and randomness
    Partovi, AH
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, PT 2, 2001, 568 : 31 - 37
  • [3] Algorithmic complexity and applications
    Calude, Cristian S.
    Jurgensen, Helmut
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : VII - VIII
  • [4] Algorithmic Folding Complexity
    Jean Cardinal
    Erik D. Demaine
    Martin L. Demaine
    Shinji Imahori
    Tsuyoshi Ito
    Masashi Kiyomi
    Stefan Langerman
    Ryuhei Uehara
    Takeaki Uno
    Graphs and Combinatorics, 2011, 27 : 341 - 351
  • [5] Algorithmic complexity of a protein
    Dewey, TG
    PHYSICAL REVIEW E, 1996, 54 (01): : R39 - R41
  • [6] The Algorithmic Complexity of Landscapes
    Papadimitriou, Fivos
    LANDSCAPE RESEARCH, 2012, 37 (05) : 591 - 611
  • [7] The history of Algorithmic complexity
    Nasar, Audrey A.
    MATHEMATICS ENTHUSIAST, 2016, 13 (03): : 217 - 242
  • [8] Chaos and algorithmic complexity
    Batterman, RW
    White, H
    FOUNDATIONS OF PHYSICS, 1996, 26 (03) : 307 - 336
  • [9] On the algorithmic complexity of crystals
    Krivovichev, S. V.
    MINERALOGICAL MAGAZINE, 2014, 78 (02) : 415 - 435
  • [10] Algorithmic Folding Complexity
    Cardinal, Jean
    Demaine, Erik D.
    Demaine, Martin L.
    Imahori, Shinji
    Ito, Tsuyoshi
    Kiyomi, Masashi
    Langerman, Stefan
    Uehara, Ryuhei
    Uno, Takeaki
    GRAPHS AND COMBINATORICS, 2011, 27 (03) : 341 - 351