Wang tiles which can be used to simulate the behaviour of any Turing machine. Because the halting problem is non computable, then there is no computable function that, given a finite set of Wang tiles, can put any bounds on the size of the largest region it can tile.