Definition: Let c be a configuration. M makes zero moves from c to c; in symbols,
c |– 0 c [e] or, simply, c |– 0 c
Definition: Let c0, c1, ..., cn be a sequence of configurations, n ³ 1, and ci-1  |– ci [ri], ri Î R, for all i = 1, ..., n; that is,
c0  |– c1 [r1] |– c2 [r2] …  |– cn [rn]
Then M makes n moves from c0 to cn:
c0  |– n cn [r1... rn] or, simply, c0  |– n cn
Sequence of Moves 1/2
 Gist: Several consecutive computational steps
14/29