Abstract
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular, Bennett identified the classes of weakly deep and strongly deep sequences, and showed that the halting problem is strongly deep. Juedes, Lathrop, and Lutz subsequently extended this result by defining the class of weakly useful sequences, and proving that every weakly useful sequence is strongly deep.
The present paper investigates refinements of Bennett's notions of weak and strong depth, called recursively weak depth (introduced by Fenner, Lutz and Mayordomo) and recursively strong depth (introduced here). It is argued that these refinements naturally capture Bennett's idea that deep objects are those which “contain internal evidence of a nontrivial causal history.” The fundamental properties of recursive computational depth are developed, and it is shown that the recursively weakly (respectively, strongly) deep sequences form a proper subclass of the class of weakly (respectively, strongly) deep sequences. The above-mentioned theorem of Juedes, Lathrop, and Lutz is then strengthened by proving that every weakly useful sequence is recursively strongly deep. It follows from these results that not every strongly deep sequence is weakly useful, thereby answering a question posed by Juedes.
This research was supported in part by National Science Foundation Grant CCR-9157382, with matching funds from Rockwell, Microware Systems Corporation, and Amoco Foundation.
Preview
Unable to display preview. Download preview PDF.
References
K. Ambos-Spies and Y. Wang. 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, 1996.
C. H. Bennett. Dissipation, information, computational complexity and the definition of organization. In D. Pines, editor, Emerging Syntheses in Science, Proceedings of the Founding Workshops of the Santa Fe Institute, pages 297–313, 1985.
C. H. Bennett. Logical depth and physical complexity. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 227–257. Oxford University Press, 1988.
S. A. Fenner, J. H. Lutz, and E. Mayordomo. Weakly useful sequences. In Proceedings of the 22 nd International Colloquium on Automata, Languages, and Programming, pages 393–404. Springer-Verlag, 1995.
W. I. Gasarch and J. H. Lutz. Unpublished manuscript, 1991.
D. W. Juedes. The Complexity and Distribution of Computationally Useful Problems. PhD thesis, Department of Computer Science, Iowa State University, 1994.
D. W. Juedes, J. I. Lathrop, and J. H. Lutz. Computational depth and reducibility. Theoretical Computer Science, 132:37–70, 1994.
J. I. Lathrop. Compression depth and the behavior of cellular automata. Complex Systems, 1997. To appear.
J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220–258, 1992.
P. Martin-Löf. On the definition of random sequences. Information and Control, 9:602–619, 1966.
C. P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246–258, 1971.
C. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, 218, 1971.
R. J. Solomonoff. A formal theory of inductive inference. Information and Control, 7:1–22, 224–254, 1964.
M. van Lambalgen. Random Sequences. PhD thesis, Department of Mathematics, University of Amsterdam, 1987.
Y. Wang. Randomness and Complexity. PhD thesis, Department of Mathematics, University of Heidelberg, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lathrop, J.I., Lutz, J.H. (1997). Recursive computational depth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_171
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive