Algorithmic complexity and randomness in elastic solids

Details Algorithmic complexity and randomness in elastic solids Algorithmic complexity and randomness in elastic solids

2008-11-04

arxiv.org/abs/0811.0623v1

Computer Science

Computational Complexity

Scientific paper

A system comprised of an elastic solid and its response to an external random force sequence is shown to behave based on the principles of the theory of algorithmic complexity and randomness. The solid distorts the randomness of an input force sequence in a way proportional to its algorithmic complexity. We demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally random input force. 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. This agrees with the theory introduced in [16] which states that physical systems such as this behave as algorithmic selection-rules which act on random actions in their surroundings.

Affiliated with

Also associated with

No associations

Rating

Algorithmic complexity and randomness in elastic solids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic complexity and randomness in elastic solids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic complexity and randomness in elastic solids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372697