Journal of Symbolic Logic

Complex tilings

Bruno Durand, Leonid A. Levin, and Alexander Shen

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


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.

Article information

J. Symbolic Logic, Volume 73, Issue 2 (2008), 593-613.

First available in Project Euclid: 16 April 2008

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Tilings Kolmogorov complexity recursion theory


Durand, Bruno; Levin, Leonid A.; Shen, Alexander. Complex tilings. J. Symbolic Logic 73 (2008), no. 2, 593--613. doi:10.2178/jsl/1208359062.

Export citation