This document discusses the domino problem, which asks if a given finite set of tile types can tile the plane. The document proves that the domino problem is undecidable, meaning there is no algorithm that can determine for all possible domino systems whether the plane can be fully tiled. This shows that there are inherent limitations in formal systems for describing tiling problems on infinite surfaces.