On the algorithmic complexity of static structures

Joel Ratsaby, J. Chaskalovic

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1037-1053
Number of pages17
JournalJournal of Systems Science and Complexity
Volume23
Issue number6
DOIs
StatePublished - 27 Dec 2010
Externally publishedYes

Keywords

  • Data compression
  • descriptional complexity
  • randomness
  • static structure

Fingerprint

Dive into the research topics of 'On the algorithmic complexity of static structures'. Together they form a unique fingerprint.

Cite this