An algebra of mixed computation
A mixed computation is defined as a multi-valued mapping \(M: P\times S\to P\times S\), where \(P\) is the set of all operators, \(S\) the set of all memory states. A nondeterministic memory state (NDMS) algebra \((S;0,+,*,\Delta)\) of the type \((0,2,2,2)\) is constructed for any basis of the memory, and it is proved that this algebra is quasi-Boolean. The notion of operator is defined and some properties of operators are proved. On the end a few problems for further investigations are given.
scientific article; zbMATH DE number 25194