I'm having trouble finding explicit recipes on the web for having a computer generate a finite excerpt of a Penrose tiling (in any of its equivalent forms; personally I like the rhombus-tilings). One sort of solution would be a prescription of the form "To generate the set of vertices of the rhombus-tiling that lie within distance d of the origin in C, let zeta = exp(2 Pi i / 5) and take all sums of the form a_1 zeta + a_2 zeta^2 + a_3 zeta^3 + a_4 zeta^4 with a_1, a_2, a_3, a_4 in Z satisfying the following inequalities: ..." Another sort of recipe would be an algebraic version of the inflation rule, where one starts with a finite set of colored points in R^2 and then replaces it by a larger set of colored points, applying some linear maps to get new points from old (where the choice of map depends on the color of the point, and new points get colored according to some rule). Surely something of this sort is on the web, but I haven't been able to find it. For that matter, I recall that there's a nice way to characterize one of the versions of Penrose tilings by means of the algebraic conjugacy of Q(zeta) (with zeta as above) that sends zeta^k to zeta^2k: we take those points in Q(zeta) such that the image of the point under the conjugacy lies in some finite window (a pentagon of some size centered on 0, as I recall). I learned about this from Veit Elser at an Oberwolfach meeting many years ago, and I believe it may be due independently to Veit and Rick Kenyon; was a description of this point of view ever published? Jim Propp