- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Effective fractal dimensions
Mathematical Logic Quarterly 51 (1):62-72 (2005)
Abstract
Classical fractal dimensions have recently been effectivized by characterizing them in terms of real-valued functions called gales, and imposing computability and complexity constraints on these gales. This paper surveys these developments and their applications in algorithmic information theory and computational complexity theoryOther Versions
No versions found
My notes
Similar books and articles
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one.Chris J. Conidis - 2012 - Journal of Symbolic Logic 77 (2):447-474.
Completeness, Compactness, Effective Dimensions.Stephen Binns - 2013 - Mathematical Logic Quarterly 59 (3):206-218.
Compressibility and Kolmogorov Complexity.Stephen Binns & Marie Nicholson - 2013 - Notre Dame Journal of Formal Logic 54 (1):105-123.
Fractal dimensions of K-automatic sets.Alexi Block Gorman & Chris Schulz - 2024 - Journal of Symbolic Logic 89 (3):1128-1157.
On the computability of fractal dimensions and Hausdorff measure.Ker-I. Ko - 1998 - Annals of Pure and Applied Logic 93 (1-3):195-216.
Biological Information.Stefan Artmann - 2008 - In Sahorta Sarkar & Anya Plutynski (eds.), Companion to the Philosophy of Biology. Blackwell. pp. 22–39.
A characterization of constructive dimension.Satyadev Nandakumar - 2009 - Mathematical Logic Quarterly 55 (2):185-200.
Connectivity properties of dimension level sets.Jack H. Lutz & Klaus Weihrauch - 2008 - Mathematical Logic Quarterly 54 (5):483-491.
Analytics
Added to PP
2013-10-31
Downloads
52 (#416,895)
6 months
3 (#1,471,287)
2013-10-31
Downloads
52 (#416,895)
6 months
3 (#1,471,287)
Historical graph of downloads
Citations of this work
Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Relative Kolmogorov complexity and geometry.Stephen Binns - 2011 - Journal of Symbolic Logic 76 (4):1211-1239.
Avoiding effective packing dimension 1 below array noncomputable C.e. Degrees.Rod Downey & Jonathan Stephenson - 2018 - Journal of Symbolic Logic 83 (2):717-739.
Completeness, Compactness, Effective Dimensions.Stephen Binns - 2013 - Mathematical Logic Quarterly 59 (3):206-218.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-559df78dcc-q5wnn uwo