|

There
are, in conclusion, at least two different types of memory matrices, and
one can use them either separatedly or together. This makes it important
to distinguish between the memory matrix method and the particular algorithms
which are based on it, and in order to underline such a distinction it
is convenient to adopt a new terminology.
The family of all algorithms which use memory matrices is referred to
as MRM (Memory Reconstruction Method), whereas any individual member
of this family is indicated with the label MRM followed by a number. More
precisely, MRM-1 is the algorithm which employs only the vortex memory
(Density Modulation), MRM-2 is using only the stationary points
memory, and MRM-3 is the algorithm of formula (3-12) which exploits both
memories.
At this point we are left with the problem of discovering yet more memory
matrices, and here we have plenty of suggestions. It is plausible, for
example, that a memory of boundaries, or more in general a memory
of discontinuities, could be built, but we can leave these developments
to the future. We have seen that the memory matrix method can indeed perform
reconstructions from incomplete information, and we already have therefore
what we were looking for: a model that may help us understanding the logic
of embryonic development.
The
two general principles of MRM
When
we speak of mathematical models for biology, we usually refer to formulae
(such as the Hardy-Weinberg theorem, or the Lotka-Volterra equations)
that effectively describe some features of living systems.
|