The aperiodicity referred to is a property of the particular set of prototiles; the various resulting tilings themselves are just non-periodic.
As early as AD 325, Pappus of Alexandria knew that only 3 types of regular polygons (the square, equilateral triangle, and hexagon) can fit perfectly together in repeating tessellations on a Euclidean plane.
They are built from flat faces and straight edges and have sharp corner turns at the vertices.
The problem as stated was solved by Karl Reinhardt in 1928, but sets of aperiodic tiles have been considered as a natural extension.
[7] The specific question of aperiodic sets of tiles first arose in 1961, when logician Hao Wang tried to determine whether the Domino Problem is decidable — that is, whether there exists an algorithm for deciding if a given finite set of prototiles admits a tiling of the plane.
Hence, when in 1966 Robert Berger found an aperiodic set of prototiles this demonstrated that the tiling problem is in fact not decidable.
[8] (Thus Wang's procedures do not work on all tile sets, although that does not render them useless for practical purposes.)
The question of whether an aperiodic set exists with only a single prototile is known as the einstein problem.