An algebra of mixed computation
type: Item
instance of: scholarly article
title: An algebra of mixed computation
zbMATH Open document ID: 0735.68046
DOI: 10.1016/0304-3975(91)90300-Q
published in: Theoretical Computer Science
publication date: 1992-06-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 25194
zbMATH Keywords: DMS algebra
zbMATH Keywords: quasi-Boolean algebra
zbMATH Keywords: mixed computation
author: V. Eh. Itkin
reviewed by: Boleslaw Wojdyło
MaRDI profile type: Publication
cites work: On the partial computation principle
cites work: Q4134896
cites work: Mixed computation: potential applications and problems for study
full work available at URL: 0304-3975(91)90300-q
OpenAlex ID: W2057137836
description: scientific article; zbMATH DE number 25194