1. Antunes, L., Fortnow, L., van Melkebeek, D., Vinodchandran, N.: Computational depth: concept and applications. Theor. Comput. Sci. 354(3), 391–404 (2006)
2. Antunes, L., Costa, A., Matos, A., Vitányi, P.: Computational depth of infinite strings revisited. In: Proc. CiE 2007, Computation and Logic in the Real World (2007)
3. Bennett, C.: Logical depth and physical complexity. In: The Universal Turing Machine: A Half-Century Survey, pp. 227–257. Oxford University Press, London (1988)
4. Fenner, S., Lutz, J., Mayordomo, E., Reardon, P.: Weakly useful sequences. Inf. Comput. 197, 41–54 (2005)
5. Juedes, D., Lathrop, J., Lutz, J.: Computational depth and reducibility. Theor. Comput. Sci. 132, 37–70 (1994)