Home Link
Back
to
Index
Fixed transaction
memory set
A fixed transaction memory
set is
a set of data structures and process elements that are sufficient to
any asked-for transaction. As the figure above indicates, there
are two layers required to define a transaction memory set. The
analogy to the fixed set of
elementary atoms is illustrative. Any molecular compound needs
only a subset of atom types, and some compositional rules. The
compositional rules are a subject for molecular chemistry and is still
an open question for natural science.
There is an obvious fixed transaction set of any computational process,
or as Hoare would say for any "communicating sequential process" *<*>.
This obvious fixed transaction set is the on-off two states that define
von-Neumann computing. Every computer based transaction results
in a set of
binary values. This fact creates the huge possibilities that is
exploited by computer science, and all things digital.
The core
problem, as we see it, with the first school of computer science is
that assemble languages, programing languages and visual languages have
not created optimal stratum where each stratum is a fixed finite set of
data structure and process elements. The core problem is
reflected in the confusion created by many non-optimal solutions locked
in stable eco-systems. Evolution of the market is dysfunctional.
One may see the parallel between natural stratification and the
creation of what we are calling sub-stratum computing language.
UML (unified modeling language) *<*>
is one example of a major attempt to
define a set of symbols and procedures sufficient to define any
computer based process. UML is however, a supply side product. It
reflects the confusion that arises from the absence of clear principles
connecting formal systems with the natural systems that UML is required
to model.
