We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with 𝒪(n) Kolmogorov complexity of its (n×n)-squares. We construct tile sets for which this bound is tight: all (n×n)-squares in all tilings have complexity Ω(n). This adds a quantitative angle to classical results on non-recursivity of tilings—that we also develop in terms of Turing degrees of unsolvability.
"Complex tilings." J. Symbolic Logic 73 (2) 593 - 613, June 2008. https://doi.org/10.2178/jsl/1208359062