Lines missing every random point

DOI10.3233/COM-150038MaRDI QIDQ3195644zbMATH OpenFDO

Authors Jack H. Lutz, Neil Lutz

Publication date 20 October 2015

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/COM-150038

zbMATH Keywords

algorithmic geometric measure theorycomputable analysisrandomness

Mathematics Subject Classification ID

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

Recommendations

• Lines Missing Every Random Point
• Uniform van Lambalgen's theorem fails for computable randomness
• Randomness and the linear degrees of computability
• Computing from projections of random points
• Randomness on computable probability spaces -- a dynamical point of view

Cites work

• A unified approach to the definition of random sequences
• Almost everywhere high nonuniform complexity
• Computing space-filling curves
• Dimensions of Points in Self-Similar Fractals
• Effective dimension of points visited by Brownian motion
• scientific article; zbMATH DE number 3333146 (Why is no real title available?)
• On Fundamental Geometric Properties of Plane Line-Sets
• Point-separable classes of simple computable planar curves
• Sections of Sets of zero Lebesgue measure
• The Kakeya Problem
• The power of backtracking and the confinement of length
• Translating the Cantor set by a random real
• Upward separations and weaker hypotheses in resource-bounded measure

Cited in

(4)

• Who asked us? How the theory of computing answers questions about analysis
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• Dimension spectra of lines
• Lines Missing Every Random Point

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195644)