Notre Dame Journal of Formal Logic

Controlling Effective Packing Dimension of Δ20 Degrees

Jonathan Stephenson

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

This paper presents a refinement of a result by Conidis, who proved that there is a real X of effective packing dimension 0<α<1 which cannot compute any real of effective packing dimension 1. The original construction was carried out below '', and this paper’s result is an improvement in the effectiveness of the argument, constructing such an X by a limit-computable approximation to get XT'.

Article information

Source
Notre Dame J. Formal Logic, Volume 57, Number 1 (2016), 73-93.

Dates
Received: 23 February 2013
Accepted: 29 September 2013
First available in Project Euclid: 16 November 2015

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1447683389

Digital Object Identifier
doi:10.1215/00294527-3328401

Mathematical Reviews number (MathSciNet)
MR3447726

Zentralblatt MATH identifier
1352.03048

Subjects
Primary: 03D32: Algorithmic randomness and dimension [See also 68Q30]
Secondary: 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32]

Keywords
effective packing dimension limit-computable approximation complexity pruned clumpy trees

Citation

Stephenson, Jonathan. Controlling Effective Packing Dimension of $\Delta^{0}_{2}$ Degrees. Notre Dame J. Formal Logic 57 (2016), no. 1, 73--93. doi:10.1215/00294527-3328401. https://projecteuclid.org/euclid.ndjfl/1447683389


Export citation

References

  • [1] Athreya, K. B., J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, “Effective strong dimension in algorithmic information and computational complexity,” SIAM Journal on Computing, vol. 37 (2007), pp. 671–705.
  • [2] Bienvenu, L., D. Doty, and F. Stephan, “Constructive dimension and Turing degrees,” Theory of Computing Systems, vol. 45 (2009), pp. 740–55.
  • [3] Conidis, C. J., “A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one,” Journal of Symbolic Logic, vol. 77 (2012), pp. 447–74.
  • [4] Downey, R., and N. Greenberg, “Turing degrees of reals of positive effective packing dimension,” Information Processing Letters, vol. 108 (2008), pp. 298–303.
  • [5] Downey, R. G., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer, New York, 2010.
  • [6] Downey, R., and K. M. Ng, “Effective packing dimension and traceability,” Notre Dame Journal of Formal Logic, vol. 51 (2010), pp. 279–90.
  • [7] Fortnow, L., J. M. Hitchcock, A. Pavan, N. V. Vinodchandran, and F. Wang, “Extracting Kolmogorov complexity with applications to dimension zero-one laws,” pp. 335–45 in Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming, Part 1, vol. 4051 of Lecture Notes in Computational Science, Springer, Berlin, 2006.
  • [8] Greenberg, N., and J. S. Miller, “Diagonally non-recursive functions and effective Hausdorff dimension,” Bulletin of the London Mathematical Society, vol. 43(2011), pp. 636–54.
  • [9] Kummer, M., “Kolmogorov complexity and instance complexity of recursively enumerable sets,” SIAM Journal on Computing, vol. 25 (1996), pp. 1123–43.
  • [10] Lutz, J. H., “The dimensions of individual strings and sequences,” Information and Computation, vol. 187 (2003), pp. 49–79.
  • [11] Miller, J. S., “Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension,” Advances in Mathematics, vol. 226 (2011), pp. 373–84.
  • [12] Sacks, G. E., “On the degrees less than $\mathbf{0}'$,” Annals of Mathematics (2), vol. 77 (1963), pp. 211–31.
  • [13] Soare, R. I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, in Perspectives in Mathematical Logic, Springer, Berlin, 1987.
  • [14] Soare, R. I., Computability Theory and Applications: The Art of Classical Computability, Springer, Berlin, 2016.
  • [15] Spector, C., “On degrees of recursive unsolvability,” Annals of Mathematics (2), vol. 64 (1956), pp. 581–92.
  • [16] Yates, C., “Initial segments of the degrees of unsolvability, I: A survey,” pp. 63–83, in Mathematical Logic and Foundations of Set Theory (Jerusalem, 1968), edited by Y. Bar-Hillel, vol. 59 of Studies in Logic and the Foundations of Mathematics, North Holland, Amsterdam, 1970.