ALGORITHMIC COMPLEXITY OF SOME PHYSICAL PROCESSES

B.S. Sagintaev
Additional contact information
B.S. Sagintaev: Astrophysical Institute of National Academy of Scienses Almaty, 480068, Republic of Kazakhstan

International Journal of Modern Physics C (IJMPC), 1994, vol. 05, issue 02, 421-424

Abstract: Measure of algorithmic complexity c(n) which has been suggested by Lempel and Ziv is one of important quantities for characterizing properties of nonlinear dynamical systems. The temporal variation of c(n) is investigated for time series generated by some physical processes. The relationship between algorithmic complexity and other characteristics of nonlinear systems is discussed.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183194000623
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:05:y:1994:i:02:n:s0129183194000623

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183194000623

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().