11 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
A Note on Pointwise Dimensions
Neil Lutz
This short note describes a connection between algorithmic dimensions of individual points and classical pointwise dimensions of measures.
Fractal Intersections and Products via Algorithmic Dimension
Neil Lutz
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensio…
Bounding the Dimension of Points on a Line
Neil Lutz, D. M. Stull
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to…
Stateless Computation
Danny Dolev, Michael Erdmann, Neil Lutz +2
We present and explore a model of stateless and self-stabilizing distributed computation, inspired by real-world applications such as routing on today's Internet. Processors in our…