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 条
  • [31] On algorithmic complexity of imprecise spanners
    Poureidi, Abolfazl
    Farshi, Mohammad
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 117
  • [32] Algorithmic complexity of quantum capacity
    Samad Khabbazi Oskouei
    Stefano Mancini
    Quantum Information Processing, 2018, 17
  • [33] Algorithmic complexity and efficiency of a ratchet
    Depto. de Física, Fac. Ing., Univ. Nac. Mar Plata, A., Plata, Argentina
    不详
    Phys A Stat Mech Appl, 2 (285-292):
  • [34] Algorithmic complexity of quantum capacity
    Oskouei, Samad Khabbazi
    Mancini, Stefano
    QUANTUM INFORMATION PROCESSING, 2018, 17 (04)
  • [35] ALGORITHMIC COMPLEXITY OF DISCRETE FUNCTIONS
    OFMAN, Y
    DOKLADY AKADEMII NAUK SSSR, 1962, 145 (01): : 48 - &
  • [36] Algorithmic complexity as a criterion of unsolvability
    Burgin, Mark
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 244 - 259
  • [37] ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS
    ALDER, A
    STRASSEN, V
    THEORETICAL COMPUTER SCIENCE, 1981, 15 (02) : 201 - 211
  • [38] On the Improbability of Algorithmic Specified Complexity
    Ewert, Winston
    Marks, Robert J., II
    Dembski, William A.
    45TH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2013, : 68 - 70
  • [39] On the algorithmic complexity of edge total domination
    Zhao, Yancai
    Liao, Zuhua
    Miao, Lianying
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 28 - 33
  • [40] Algorithmic complexity of thermal ratchet motion
    Sanchez, JR
    Family, F
    Arizmendi, CM
    PHYSICS LETTERS A, 1998, 249 (04) : 281 - 285