Constructive Dimension and Turing Degrees
- 37 Downloads
This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim H(S) and constructive packing dimension dim P(S) is Turing equivalent to a sequence R with dim H(R)≥(dim H(S)/dim P(S))−ε, for arbitrary ε>0. Furthermore, if dim P(S)>0, then dim P(R)≥1−ε. The reduction thus serves as a randomness extractor that increases the algorithmic randomness of S, as measured by constructive dimension.
A number of applications of this result shed new light on the constructive dimensions of Turing degrees. A lower bound of dim H(S)/dim P(S) is shown to hold for the Turing degree of any sequence S. A new proof is given of a previously-known zero-one law for the constructive packing dimension of Turing degrees. It is also shown that, for any regular sequence S (that is, dim H(S)=dim P(S)) such that dim H(S)>0, the Turing degree of S has constructive Hausdorff and packing dimension equal to 1.
Finally, it is shown that no single Turing reduction can be a universal constructive Hausdorff dimension extractor, and that bounded Turing reductions cannot extract constructive Hausdorff dimension. We also exhibit sequences on which weak truth-table and bounded Turing reductions differ in their ability to extract dimension.
KeywordsConstructive dimension Turing Extractor Degree Randomness
Unable to display preview. Download preview PDF.
- 2.Bienvenu, L., Doty, D., Stephan, F.: Constructive dimension and weak truth-table degrees. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) Computation and Logic in the Real World—Third Conference of Computability in Europe (CiE 2007), Siena, Italy, June 18–23, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4497, pp. 63–72. Springer, Berlin (2007) Google Scholar
- 4.Doty, D.: Every sequence is decompressible from a random one. In: Logical Approaches to Computational Barriers, Proceedings of the Second Conference on Computability in Europe, Swansea, UK, July 2006. Lecture Notes in Computer Science, vol. 3988, pp. 153–162. Springer, Berlin (2006) Google Scholar
- 6.Fortnow, L., Hitchcock, J.M., Aduri, P., Vinodchandran, N.V., Wang, F.: Extracting Kolmogorov complexity with applications to dimension zero-one laws. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 4051, pp. 335–345. Springer, Berlin (2006) CrossRefGoogle Scholar
- 9.Hemaspaandra, L., Hempel, H., Vogel, J.: Optimal separations for parallel versus sequential self-checking: parallelism can exponentially increase self-checking cost. Technical Report TR 691, Department of Computer Science, University of Rochester, May 1998 Google Scholar
- 15.Miller, J.: Extracting information is hard. Technical Report (2008). http://www.math.uconn.edu/~josephmiller/Papers/dimension.pdf
- 16.Nies, A., Reimann, J.: A lower cone in the wtt degrees of non-integral effective dimension. In: Proceedings of IMS workshop on Computational Prospects of Infinity, Singapore (2009, to appear). Earlier version appeared as Technical Report 63, Workgroup Mathematical Logic and Theoretical Computer Science, University of Heidelberg (2005) Google Scholar
- 19.Reimann, J.: Computability and fractal dimension. Doctoral thesis, Heidelberg (2005) Google Scholar
- 20.Reimann, J., Slaman, T.: Randomness, Entropy and Reducibility. Manuscript (2005) Google Scholar
- 24.Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987) Google Scholar
- 25.Stephan, F.: Hausdorff-dimension and weak truth-table reducibility. Technical Report TR52/05, School of Computing, National University of Singapore (2005) Google Scholar
- 29.Zimand, M.: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Technical Report 0705.4658, Computing Research Repository (2007) Google Scholar