An algorithmic complexity interpretation of lin's third law of information theory

Entropy

Volumn 10, Issue 1, 2008, Pages 6-14

  Ratsaby, Joel ^a  

^a ARIEL UNIVERSITY   (Israel)

Author keywords

Algorithmic complexity; Binary sequences; Entropy; Information theory; Randomness

Indexed keywords

EID: 42149101327     PISSN: None     EISSN: 10994300     Source Type: Journal    
DOI: 10.3390/entropy-e10010006     Document Type: Article

References (22)

1. Asarin, A. E. Some properties of Kolmogorov δ random finite sequences. SIAM Theory of Probability and its Applications 1987, 32, 507-508.
2. Asarin, A. E. On some properties of finite objects random in an algorithmic sense. Soviet Mathematics Doklady 1988, 36(1), 109-112.
3. Bienvenu, L. Kolmogorov-loveland stochasticky and kolmogorov complexity. In Proc. 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2007), 2007; Vol. LNCS 4393, pp. 260-271.
4. Chaitin, G. J. A theory of program size formally identical to information theory. Journal of the ACM 1975 22(3), 329-340.
5. Cover, T. M.; Thomas, J. A. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing), 2nd Ed.; Wiley-Interscience: New York, USA, July 2006.
6. Durand, B.; Vereshchagin, N. Kolmogorov-Loveland stochasticity for finite strings. Information Processing Letters 2004, 91(6), 263-269.
7. Gacs, P. On the symmetry of algorithmic information. Soviet Mathematics Doklady 1974, 15, 1477-1480.
8. Kolmogorov, A. N. On tables of random numbers. Sankhyaa, The Indian Journal of Statistics 1963, A25, 369-376.
9. Kolmogorov, A. N. Three approaches to the quantitative definition of information. Problems of Information Transmission 1965, 1, 1-17.
10. Kolmogorov, A. N. On tables of random numbers. Theoretical Computer Science 1998, 207(2), 387-395.
11. Lewandowski, S. J.; Paumier, E.; Quere, Y.; Sobolewski, R.; Toulemonde, M.; Konopka, J.; Dural, J.; Bielska-Lewandowska, H.; Gierlowski, P.; Jung, G.; Fan, J.Y. Observation of transient response of Nb superconducting thin film to a single-heavy-ion impact. Europhysics Letters 1988, 6(5), 425-430.
12. Lin, S. K. Correlation of entropy with similarity and symmetry. Journal of Chemical Information and Computer Sciences 1996, 36, 367-376.
13. Lin, S. K. The nature of the chemical process. 1. symmetry evolution - revised information theory, similarity principle and ugly symmetry. International Journal of Molecular Sciences 2001, 2, 10-39.
14. Lin, S. K. Gibbs paradox and the concepts of information, symmetry, similarity and their relationship. Entropy 2008, 10, 1-5.
15. Loveland, D. W. A new interpretation of the von Mises' concept of random sequence. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1966, 12, 279-294.
16. Martin-Löf, P. The definition of random sequences. Information and Control 1966, 9, 602-619.
17. 3/Pt thin films. Journal of Applied Physics 2006, 99(1), 016101.
18. Rissanen, J. Stochastic Complexity in Statistical Inquiry, Series in Computer Science; World Scientific: Singapore, 1989; Volume 15.
19. Schnorr, C. P. A unified approach to the definition of random sequences. Mathematical Systems Theory 1971, 5, 246-258.
20. Shen, A. On relations between different algorithmic definitions of randomness. Soviet Mathematics Doklady 1989, 38, 316-319.
21. Varentsov, D.; Spiller, P.; Tahir, N. A.; Hoffman, D. H. H.; Constantin, C.; Dewald, E.; Jacoby, J.; Lomonsov, I.V.; Neuner, U.; Shutov, A.; Wieser, J.; Udrea, S.; Bock, R. Energy loss dynamics of intense heavy ion beams interacting with solid targets. Laser and Particle Beams 2002, 485-491.
22. Vyugin, V. V. Algorithmic complexity and stochastic properties of finite binary sequences. The Computer Journal 1999, 42, 294-317.