Wang tiles are squares coloured on each edge, and placed so that abutting edges of adjacent tiles have the same colour; hence they are sometimes called Wang dominoes. A suitable set of Wang dominoes can tile the plane, but only aperiodically. This is known because any Turing machine can be represented as a set of Wang dominoes that tile the plane if and only if the Turing machine does not halt. Since the halting problem is undecidable, the problem of deciding whether a Wang domino set can tile the plane is also undecidable.