The power of backtracking and the confinement of length
From MaRDI portal
Publication:4907134
DOI10.1090/S0002-9939-2012-11385-1zbMath1294.03042arXiv1106.3310MaRDI QIDQ4907134
Publication date: 4 March 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.3310
Constructive and recursive analysis (03F60) Connected and locally connected spaces (general aspects) (54D05) Algorithmic randomness and dimension (03D32)
Related Items (5)
Lines missing every random point1 ⋮ Subsets of rectifiable curves in Banach spaces. I: Sharp exponents in traveling salesman theorems ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Computing boundary extensions of conformal maps ⋮ Computability of Subsets of Metric Spaces
Cites Work
- Curves that must be retraced
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Effective versions of local connectivity properties
- Computing space-filling curves
- Rectifiable sets and the traveling salesman problem
- Space-filling curves
- The dimensions of individual strings and sequences
- Effective fractal dimensions
- Algorithmic Randomness and Complexity
- Plottable Real Number Functions and the Computable Graph Theorem
- Characterization of Subsets of Rectifiable Curves in R n
- Degrees of unsolvability of continuous functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The power of backtracking and the confinement of length