Algorithmic randomness and analysis

In this thesis we study the interaction between algorithmic randomness and mathematical analysis. In particular, we focus on the connection between analysis and the fields of effective dimension and resource bounded randomness. We begin with the effective dimension of Euclidean points. We show that the techniques from algorithmic information can be used successfully to study problems in fractal geometry. Specifically, we investigate the Hausdorff of projections of Euclidean subsets. Using Kolmogorov complexity, we give a new proof of the celebrated Marstrand projection theorem. We also prove, using similar methods, two new lower bounds on projections. The first shows that Marstrand’s theorem holds for more general subsets of R. The second gives a lower bound on the packing dimension of projections for arbitrary sets. Our next work is on the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual points on L. We use Kolmogorov complexity and geometrical arguments to show that, if the effective Hausdorff dimension dim(a, b) is equal to the effective packing dimension Dim(a, b), then sp(L) contains a unit interval. We also show that, if the dimension dim(a, b) is at least one, then sp(L) is infinite. Together with previous work, this implies that the dimension spectrum of any line is infinite. Our last topic is on the connection between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize