We prove that the parallel updating of the chip-firing game on undirec
ted graphs is universal. To achieve that, we simulate any given two-re
gister machine by chip configurations. As corollaries, we prove that f
or finite graphs there exists exponential transient time to reach peri
odic configurations as well as exponential cycles. Also, we prove, for
infinite graphs, that the reachability problem is undecidable.