A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 77 (2):447-474 (2012)
Recently, the Dimension Problem for effective Hausdorff dimension was solved by J. Miller in , where the author constructs a Turing degree of non-integral Hausdorff dimension. In this article we settle the Dimension Problem for effective packing dimension by constructing a real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (on the other hand, it is known via [10, 3, 7] that every real of strictly positive effective Hausdorff dimension computes reals whose effective packing dimensions are arbitrarily close to, but not necessarily equal to, one)
|Keywords||Computability theory Kolmogorov complexity effective fractal dimension algorithmic randomness|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Rod Downey & Keng Meng Ng (2010). Effective Packing Dimension and Traceability. Notre Dame Journal of Formal Logic 51 (2):279-290.
Stephen Binns & Marie Nicholson (2013). Compressibility and Kolmogorov Complexity. Notre Dame Journal of Formal Logic 54 (1):105-123.
Eric Dietrich, Arthur B. Markman & Michael Winkley (2003). The Prepared Mind: The Role of Representational Change in Chance Discovery. In Yukio Ohsawa Peter McBurney (ed.), Chance Discovery by Machines. Springer-Verlag, pp. 208-230..
Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.
Grigori Mints (2012). Effective Cut-Elimination for a Fragment of Modal Mu-Calculus. Studia Logica 100 (1-2):279-287.
Russell Miller (2005). The Computable Dimension of Trees of Infinite Height. Journal of Symbolic Logic 70 (1):111-141.
William J. Collins & Paul Young (1983). Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. Journal of Symbolic Logic 48 (4):913-920.
Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller (2006). Every 1-Generic Computes a Properly 1-Generic. Journal of Symbolic Logic 71 (4):1385 - 1393.
Tom Eyers (2012). Lacan and the Concept of the 'Real'. Palgrave Macmillan.
Jonathan Bennett (1966). Real. Mind 75 (300):501-515.
Deanell Reece Tacha (2009). Packing Your Briefcase. In Scott W. Cameron, Galen L. Fletcher & Jane H. Wise (eds.), Life in the Law: Service & Integrity. J. Reuben Clark Law Society, Brigham Young University Law School.
Jeffrey K. McDonough (2010). Leibniz and the Puzzle of Incompossibility: The Packing Strategy. Philosophical Review 119 (2):135-163.
George Barmpalias (2003). The Approximation Structure of a Computably Approximable Real. Journal of Symbolic Logic 68 (3):885-922.
Ronald F. Bustamante Medina (2010). Rank and Dimension in Difference-Differential Fields. Notre Dame Journal of Formal Logic 52 (4):403-414.
Taras Banakh, Nadya Lyaskovska & Dušan Repovš (2009). Packing Index of Subsets in Polish Groups. Notre Dame Journal of Formal Logic 50 (4):453-468.
Sorry, there are not enough data points to plot this chart.
Added to index2012-04-05
Total downloads1 ( #454,238 of 1,100,097 )
Recent downloads (6 months)1 ( #304,144 of 1,100,097 )
How can I increase my downloads?