  A graph is periodic if it can be obtained by joining identical pieces in a
cyclic fashion. It is shown that the limit crossing number of a periodic graph
is computable. This answers a question of Benny Pinontoan and Bruce Richter
(2004).
