Recursive Computational Depth

Information and Computation

Volumn 153, Issue 2, 1999, Pages 139-172

  Lathrop, James I ^a   Lutz, Jack H ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346304059     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2794     Document Type: Article

References (30)

1. Ambos-Spies, K., and Wang, Y. (1996), "Algorithmic Randomness Concepts: A Comparison," talk by K. Ambos-Spies at the Workshop on Information and Randomness in Complexity Classes, Schloss Dagstuhl, Germany, July 17.
2. Balcázar, J. L., Díaz, J., and Gabarró, J. (1995), "Structural Complexity I," 2nd ed., Springer-Verlag, Berlin.
3. Bennett, C. H. (1985), Dissipation, information, computational complexity and the definition of organization, in "Emerging Syntheses in Science, Proceedings of the Founding Workshops of the Santa Fe Institute" (D. Pines, Ed.), pp. 297-313.
4. Bennett, C. H. (1988), Logical depth and physical complexity, in "The Universal Turing Machine: A Half-Century Survey" (R. Herken, Ed.), pp. 227-257, Oxford Univ. Press, London.
5. Chaitin, G. J. (1975), A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22, 329-340.
6. Fenner, S. A., Lutz, J. H., and Mayordomo, E. (1995), Weakly useful sequences, in "Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming," pp. 393-404, Springer-Verlag, Berlin.
7. Gasarch, W. I., and Lutz, J. H. (1991), unpublished manuscript.
8. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, New York.
9. Juedes, D. W. (1994), "The Complexity and Distribution of Computationally Useful Problems," Ph.D. thesis, Iowa State University.
10. Juedes, D. W., Lathrop, J. I., and Lutz, J. H. (1994), Computational depth and reducibility, Theor. Comput. Sci. 132, 37-70.
11. 2, Theor. Comput. Sci. 143, 149-158.
12. Lathrop, J. I. (1997), Compression depth and the behavior of cellular automata, Complex Systems, to appear.
13. Levin, L. A. (1973), On the notion of a random sequence, Soviet. Math. Dokl. 14, 1413-1416.
14. Levin, L. A. (1974), Laws of information conservation (nongrowth) and aspects of the foundation of probability theory, Probl. Inf. Trans. 10, 206-210.
15. Li, M., and Vitányi, P. M. B. ( 1997), "An Introduction to Kolmogorov Complexity and its Applications," 2nd ed., Springer-Verlag, Berlin.
16. Lisagor, L. R. (1981), The Banach-Mazur game, Math. USSR Sb. 38, 201-206.
17. Lutz, J. H. (1990), Category and measure in complexity classes, SIAM J. on Comput. 19, 1100-1131.
18. Lutz, J. H. (1992), Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44, 220-258.
19. Martin-Löf, P. (1966), The definition of random sequences, Inform. and Control 9, 602-619.
20. Mayordomo, E. (1994), "Contributions to the Study of Resource-Bounded Measure," Ph.D. thesis, Universitat Politècnica de Catalunya.
21. Oxtoby, J. C. (1980), "Measure and Category," 2nd ed., Springer-Verlag, Berlin.
22. Rogers, H., Jr. (1967), "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York.
23. Royden, H. L. (1988), "Real Analysis," third edition, Macmillan Company, New York.
24. Schnorr, C. P. (1971), A unified approach to the definition of random sequences, Math. Systems Theory 5, 246-258.
25. Schnorr, C. P. (1971), "Zufälligkeit und Wahrscheinlichkeit," Lecture Notes in Mathematics, Vol. 218, Springer-Verlag, New York/Berlin.
26. Schnorr, C. P. (1973), Process complexity and effective random tests, J. Comput. System Sci. 7, 376-388.
27. Solomonoff, R. J. (1964), A formal theory of inductive inference, Inform. and Control 7, 224-254.
28. van Lambalgen, M. (1987), "Random Sequences," Ph.D. thesis, Department of Mathematics, University of Amsterdam.
29. Wang, Y. (1996), "Randomness and Complexity," Ph.D. thesis, Department of Mathematics, University of Heidelberg.
30. Zvonkin, A. K., and Levin, L. A. (1970), The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surveys 25, 83-124.