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 条
  • [21] THE ALGORITHMIC COMPLEXITY OF COLOR SWITCHING
    CHEE, YM
    LIM, A
    INFORMATION PROCESSING LETTERS, 1992, 43 (02) : 63 - 68
  • [22] Algorithmic complexity of financial motions
    Brandouy, Olivier
    Delahaye, Jean-Paul
    Ma, Lin
    Zenil, Hector
    RESEARCH IN INTERNATIONAL BUSINESS AND FINANCE, 2014, 30 : 336 - 347
  • [23] ALGORITHMIC COMPLEXITY OF ALGEBRAIC SYSTEMS
    SELIVANOV, VL
    MATHEMATICAL NOTES, 1988, 44 (5-6) : 944 - 950
  • [24] Algorithmic Stability and Hypothesis Complexity
    Liu, Tongliang
    Lugosi, Gabor
    Neu, Gergely
    Tao, Dacheng
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [25] ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY
    Barmpalias, George
    BULLETIN OF SYMBOLIC LOGIC, 2013, 19 (03) : 318 - 350
  • [26] ON THE ALGORITHMIC COMPLEXITY OF TOTAL DOMINATION
    LASKAR, R
    PFAFF, J
    HEDETNIEMI, SM
    HEDETNIEMI, ST
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 420 - 425
  • [27] Algorithmic complexity in the minority game
    Mansilla, R
    PHYSICAL REVIEW E, 2000, 62 (04): : 4553 - 4557
  • [28] Algorithmic Complexity of Multiplex Networks
    Santoro, Andrea
    Nicosia, Vincenzo
    PHYSICAL REVIEW X, 2020, 10 (02)
  • [29] ALGORITHMIC COMPLEXITY OF LIST COLORINGS
    KRATOCHVIL, J
    TUZA, Z
    DISCRETE APPLIED MATHEMATICS, 1994, 50 (03) : 297 - 302
  • [30] The Complexity of Cryptocurrencies Algorithmic Trading
    Cohen, Gil
    Qadan, Mahmoud
    MATHEMATICS, 2022, 10 (12)