Polyomino tiling problems demonstrate non-computability: given a finite set of shapes, the question 'Can these shapes tile the infinite plane?' has a definite yes-or-no answer, but there is no algorithm that can compute it—the answer is true or false, but not algorithmically determinable.