Lines missing every random point1

DOI10.3233/COM-150038zbMath1333.03110MaRDI QIDQ3195644

Jack H. Lutz, Neil Lutz

Publication date: 20 October 2015

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

randomnesscomputable analysisalgorithmic geometric measure theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Length, area, volume, other geometric measure theory (28A75) Algorithmic randomness and dimension (03D32)

Related Items (4)

Dimension spectra of lines1 ⋮ Bounding the dimension of points on a line ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Unnamed Item
• Computing space-filling curves
• Effective dimension of points visited by Brownian motion
• Almost everywhere high nonuniform complexity
• Upward separations and weaker hypotheses in resource-bounded measure
• Point-Separable Classes of Simple Computable Planar Curves
• Dimensions of Points in Self-Similar Fractals
• Sections of Sets of zero Lebesgue measure
• The power of backtracking and the confinement of length
• Translating the Cantor set by a random real
• A unified approach to the definition of random sequences
• The Kakeya Problem
• On Fundamental Geometric Properties of Plane Line-Sets

This page was built for publication: Lines missing every random point1