Matthew Eastman

The tiling problem asks if a given set of tiles admits a tiling of the plane. The decidability of this problem depends on the existence of aperiodic tilesets. An aperiodic tileset is a set of tiles that admits only non-periodic tilings of the plane, that is, tilings that do not possess translational symmetry. In this talk we will look at the existence of aperiodic tilesets and present several open problems related to the tiling problem.