A useful view is to think of all computation as simulation. cf.: Isomorphism of semigroups [Preparata, F. P. and Yeh, R. T., Introduction to Discrete Structures, Addison-Wesley, 1973, p. 129.]
Given two semigroups G1 = [S, ] and G2 = [T, ] , an invertible function : S &rarr T is said to be an isomorphism between G1 and G2 if, for every a and b in S ,from which:          a b = -1 ( (a) (b) )         (a b) = (a) (b)
Contents    Page-10    Prev    Next    Page+10    Index