The geometry of fractal sets
Fractals everywhere
Complexity theory of real functions
Complexity theory of real functions
Elements of information theory
Elements of information theory
Proceedings of the 30th IEEE symposium on Foundations of computer science
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Iterated function systems and control languages
Information and Computation
The computational complexity of some julia sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The dimensions of individual strings and sequences
Information and Computation
Correspondence Principles for Effective Dimensions
Theory of Computing Systems
On the Complexity of Real Functions
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Constructing non-computable Julia sets
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing
Kolmogorov complexity with error
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We use nontrivial connections between the theory of computing and the fine-scale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in fractals that are computably self-similar.