Phys. Rev. E 64, 016209 (2001) [9 pages]Effective normalization of complexity measurements for epoch length and sampling frequencyReceived 22 November 2000; revised 21 March 2001; published 14 June 2001 The algorithmic complexity of a symbol sequence is sensitive to the length of the message. Additionally, in those cases where the sequence is constructed by the symbolic reduction of an experimentally observed wave form, the corresponding value of algorithmic complexity is also sensitive to the sampling frequency. In this contribution, we present definitions of algorithmic redundancy that are sequence-sensitive generalizations of Shannon’s original definition of information redundancy. In contrast with algorithmic complexity, we demonstrate that algorithmic redundancy is not sensitive to message length or to observation scale (sampling frequency) when stationary systems are examined. © 2001 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.64.016209
DOI:
10.1103/PhysRevE.64.016209
PACS:
05.45.-a
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.