An algebra of mixed computation
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(7)- Algorithmic analysis of mixed computations
- An algebraic approach to computations with progress
- scientific article; zbMATH DE number 3986622 (Why is no real title available?)
- scientific article; zbMATH DE number 17810 (Why is no real title available?)
- scientific article; zbMATH DE number 4123276 (Why is no real title available?)
- scientific article; zbMATH DE number 3894984 (Why is no real title available?)
- From partial evaluation to mixed computation
This page was built for publication: An algebra of mixed computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179696)