Complex Tilings

@inproceedings{Durand2001ComplexT,
  title={Complex Tilings},
  author={Bruno Durand and Leonid A. Levin and Alexander Shen},
  booktitle={STOC},
  year={2001}
}
We study the minimal complexity of tilings of a plane with a given tile set. We note that any tile set admits either no tiling or some tiling with \ooo(<italic>n</italic>) Kolmogorov complexity of its (<italic>n\times n</italic>)-squares. We construct tile sets for which this bound is nearly tight: all tilings have complexity ><italic>n/r(n)</italic>, given any unbounded computable monotone <italic>r</italic>. This adds a quantitative angle to classical results on non-recursivity of tilings… CONTINUE READING
18 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

The undecidability of the domino problem

  • R. Berger
  • Memoirs of the American Mathematical Society, 66
  • 1966
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…