“Another example of a class of well-defined mathematical problems that have no algorithmic solution is the tiling problem. This is formulated as follows: given a set of polygonal shapes, decide whether those shapes will tile the plane; that is, is it possible to cover the entire Euclidean plane using only these particular shapes, without gaps or overlaps?”