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 条
  • [41] ALGORITHMIC AND COMPLEXITY ANALYSIS OF INTERPOLATION SEARCH
    GONNET, GH
    ROGERS, LD
    GEORGE, JA
    ACTA INFORMATICA, 1980, 13 (01) : 39 - 52
  • [42] Algorithmic complexity of protein structure alignment
    Dewey, G
    Jia, YT
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 229 : U796 - U796
  • [43] The Algorithmic Complexity of the Paired Matching Problem
    Verhaegh, Ruben F. A.
    GRAPHS AND COMBINATORIAL OPTIMIZATION: FROM THEORY TO APPLICATIONS, CTW 2023, 2024, 13 : 1 - 13
  • [44] Algorithmic complexity of proper labeling problems
    Dehghan, Ali
    Sadeghi, Mohammad-Reza
    Ahadi, Arash
    THEORETICAL COMPUTER SCIENCE, 2013, 495 : 25 - 36
  • [45] Probability, algorithmic complexity, and subjective randomness
    Griffiths, TL
    Tenenbaum, JB
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL CONFERENCE OF THE COGNITIVE SCIENCE SOCIETY, PTS 1 AND 2, 2003, : 480 - 485
  • [46] Algorithmic complexity of shape grammar implementation
    Wortmann, Thomas
    Stouffs, Rudi
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2018, 32 (02): : 138 - 146
  • [47] Algorithmic Complexity of the Truck Factor Calculation
    Hannebauer, Christoph
    Gruhn, Volker
    PRODUCT-FOCUSED SOFTWARE PROCESS IMPROVEMENT, PROFES 2014, 2014, 8892 : 119 - 133
  • [48] Optimal algorithmic complexity of fuzzy ART
    Burwick, T
    Joublin, F
    NEURAL PROCESSING LETTERS, 1998, 7 (01) : 37 - 41
  • [49] Computational complexity, algorithmic scope, and evolution
    Sidl, Leonhard
    Faissner, Maximilian
    Uhlir, Manuel
    Velandia-Huerto, Cristian A.
    Waldl, Maria
    Yao, Hua-Ting
    Hofacker, Ivo L.
    Stadler, Peter F.
    JOURNAL OF PHYSICS-COMPLEXITY, 2025, 6 (01):
  • [50] ALGORITHMIC COMPLEXITY OF LINEAR NONASSOCIATIVE ALGEBRA
    Kerimbaev, R. K.
    Dosmagulova, K. A.
    Zhunussova, Zh Kh
    JOURNAL OF MATHEMATICS MECHANICS AND COMPUTER SCIENCE, 2020, 107 (03): : 20 - 33