Algorithmic Fractal Dimensions in Geometric Measure Theory

07/28/2020
by   Jack H. Lutz, et al.
0

The development of algorithmic fractal dimensions in this century has had many fruitful interactions with geometric measure theory, especially fractal geometry in Euclidean spaces. We survey these developments, with emphasis on connections with computable functions on the reals, recent uses of algorithmic dimensions in proving new theorems in classical (non-algorithmic) fractal geometry, and directions for future research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2019

Who Asked Us? How the Theory of Computing Answers Questions about Analysis

Algorithmic fractal dimensions – constructs of computability theory – ha...
research
01/03/2022

Mechanization of Incidence Projective Geometry in Higher Dimensions, a Combinatorial Approach

Several tools have been developed to enhance automation of theorem provi...
research
06/15/2020

Algorithmically Optimal Outer Measures

We investigate the relationship between algorithmic fractal dimensions a...
research
04/16/2020

The Dimensions of Hyperspaces

We use the theory of computing to prove general hyperspace dimension the...
research
06/08/2020

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Parameterization and approximation are two popular ways of coping with N...
research
05/05/2022

Fractal dimensions of k-automatic sets

This paper seeks to build on the extensive connections that have arisen ...
research
02/27/2023

A Brief Survey on the Approximation Theory for Sequence Modelling

We survey current developments in the approximation theory of sequence m...

Please sign up or login with your details

Forgot password? Click here to reset