Abstract
This paper introduces two complexity-theoretic formulations of Bennett’s logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to be polynomial-time deep, by proving a more general result: every language to which a nonnegligible subset of E can be reduced in uniform exponential time is polynomial-time deep.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antunes, L., Fortnow, L., van Melkebeek, D., Vinodchandran, N.: Computational depth: Concept and applications. Theoretical Computer Science (Special issue for selected papers from the 14th International Symposium on Fundamentals of Computation Theory) 354(3), 391–404 (2006)
Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension, algorithmic information, and computational complexity. SIAM Journal on Computing (to appear). Preliminary version appeared in: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 632–643. Springer, Heidelberg (2004)
Bennett, C.H.: Logical depth and physical complexity. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, pp. 227–257. Oxford University Press, London (1988)
Borel, E.: Sur les probabilités dénombrables et leurs applications arithmétiques. Rendiconti del Circolo Matematico di Palermo 27, 247–271 (1909)
Bourke, C., Hitchcock, J.M., Vinodchandran, N.V.: Entropy rates and finite-state dimension Theoretical Computer Science 349, 392–406 (to appear, 2005)
Dai, J.J., Lathrop, J.I., Lutz, J.H., Mayordomo, E.: Finite-state dimension. Theoretical Computer Science 310, 1–33 (2004)
Doty, D., Moser, P.: Finite-state dimension and lossy decompressors. Technical Report cs.CC/0609096, Computing Research Repository (2006)
Fenner, S.A., Lutz, J.H., Mayordomo, E., Reardon, P.: Weakly useful sequences. Information and Computation 197, 41–54 (2005)
Hitchcock, J.M.: Fractal dimension and logarithmic loss unpredictability. Theoretical Computer Science 304(1–3), 431–441 (2003)
Huffman, D.A.: Canonical forms for information-lossless finite-state logical machines. IRE Trans. Circuit Theory CT-6 (Special Supplement), pp. 41–59 (1959), Also available In: Moore, E.F. (ed.) Sequential Machine: Selected Papers, Addison-Wesley, pp. 866–871 (1964)
Juedes, D.W., Lathrop, J.I., Lutz, J.H.: Computational depth and reducibility. Theoretical Computer Science 132(1–2), 37–70 (1994)
Kohavi, Z.: Switching and Finite Automata Theory, 2nd edn. McGraw-Hill, New York (1978)
Lathrop, J.I., Lutz, J.H.: Recursive computational depth. Information and Computation 153(2), 139–172 (1999)
Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, Berlin (1997)
Lutz, J.H.: Almost everywhere high nonuniform complexity. J. Comput. Syst. Sci. 44(2), 220–258 (1992)
Lutz, J.H.: The quantitative structure of exponential time. In: Hemaspaandra, L.A., Selman, A.L. (eds.) Complexity Theory Retrospective II, pp. 225–254. Springer, Heidelberg (1997)
Schnorr, C.P., Stimm, H.: Endliche Automaten und Zufallsfolgen. Acta. Informatica 1, 345–359 (1972)
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal, 27:379–423, 623–656 (1948)
Sheinwald, D., Lempel, A., Ziv, J.: On encoding and decoding with two-way head machines. Information and Computation 116(1), 128–133 (1995)
Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transaction on Information Theory 24, 530–536 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doty, D., Moser, P. (2007). Feasible Depth. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)