Morphogrammatics for Dummies: The Domino Approach

A gentle introduction to some elements of morphogrammatics

Rudolf Kaehr Dr.phil@

Copyright ThinkArt Lab ISSN 2041-4358



Dominoes, morphograms, cellular automata, memristics. Topics: possible continuation, coalitions, cooperations, substitution.

1.  Introducing morphograms

Morphogrammatics is a calculus of morphic patterns, called morphograms.
In a morphogrammatic calculus, morphograms are transformed by morphogrammatic operations.
Between morphograms relations of morphogrammatic equivalence is defined.

Morphograms might be composed together to new morphograms.
There are several types of compositions, concatenation, chaining and fusion.

Morphograms are combined in an additional sense, whith concatenation.
Morphograms are combined to chains, whith chaining operation.
Morphograms are combined in an overlapping sense, whith fusion operation.

A morphic pattern, i.e. a morphogram, is build of monomorphies.

Monomorphies are taking place at a locus in a pattern.

Monomorphies are finite patterns of kenograms.

Kenograms are the marks we need to perceive morphograms. They are not signs in a technical sense. Signs are marks with identity, they even may mean something. Kenograms mean nothing, there job is to mark the differences between the monomorphies for a morphogram.

Another “gentle” introduction with different intention, in German, is written by Claus Baldus, Morgen und Morgen.  (copy blocked!)

We start with two main conventions. This will help to simplify things.

First, we encounter texts, events, behaviours at a position in a contexture of texts, events or behaviors, which we perceive and accept as structured patterns. They shall be called morphograms.

Second, the encountered patterns of the morphograms are conceived as consisting of parts, organized over different loci. They shall be called monomorphies.

Hence morphograms are characterized by the triple :

<Position, Locality, Place>.
Position of the morphogram in a morphogrammatic system defined by emanation and evolution.
Locality of the monomorphies in a morphogram; loci are offering place for different monomorphies of the same or different structure.
Monomorphies might be reduced to homogeneous patterns, [aabccc] to [aa], [b], [ccc] or they might keep some structuration, like [aab], [cc], [c].
Place of a kenom in a monomorphy depending on the length of the monomorphy.

typeset structure

typeset structure

A morphogram might be depicted as a diagrammatic pattern of monomorphies.

typeset structuretypeset structuretypeset structure   typeset structure

The same morphogram gets a block notation as:

typeset structure

The block notation gets a Left-Associative(LA) presentation which defines the morphogram:

typeset structure

An LA presentation is different to the usual binary tree presentation:

     typeset structure     typeset structure    typeset structure

But morphograms consist of monomorphies and not of atomic signs.

How to start?
We might encounter a pattern somewhere in this world with the structure [aaaabbcccaaaabbbb]. Such a pattern shall be conceived as a morphogram MG. Hence, what counts is the pattern, not the signs, {a,b,c}, inscribing the pattern for MG. Furthermore we recognize the structure of the morphogram as build by parts: [aaaa], [bbb], [ccc], [aaaa] and [bbbb]. These parts are localized in the pattern, where they get their locus of inscription. Therefore, the parts [bbb] an [ccc] are different, not by structure but by the locus the occupy. The parts of the morphogram are the monomorphies of the morphogram.

The morphogram MG might be placed somewhere in the system of morphogrammatics, and will have properties of emanative and evolutive realizations. At this point of introduction, I will omit the aspects of emanation and evulation as such.

I precis the analysis of the morphogram MG in the following table:

typeset structure

Dec(MG): the decomposition of the morphogram MG into its monomorphies mg placed at the loci loc.
Ken(MG): The marks of the monomorphies, called kenograms kg or kenoms.

Now we have an idea of a morphogram.
Morphograms might be encountered everywhere, not only as marks on a screen or on paper.

What can we do with it?

Like with domonos we might reverse a morphogram.

We proceed our little intro we the idea of prolongation. A morphogram might prolongate itself into a more complex morphogram by adding its own parts, i.e. monomorphies to itself.  
We still have only one morphogram and only its monomorphies at our disposal.

Obviously, the morphogram is able to produce different prolongations.

Now, having some morphograms at our disposal, we are ready to ask: How are morphograms interacting with each other?

In analogy we might consider coalition building by “addition” and cooperation building by “multiplication”.

1.1.  Domino-like continuations

An early attempt to formalize morpho- and kenogrammatics was modeled along the paradigm of recursive word arithmetics, i.e. regular formal languages as they are well known today in formal linguistics, the theory of computation and pogramming languages.

A very different approach was given by Roland Hausser’s Left-Association Grammars (1987). Until now, this approach wasn’t studied and applied explicitly for morpho- and kenogrammatics. One reason might be that for kenogrammatics the formal grammar approach has at first some clear conceptual advantages. But for monomorphy-based morphogrammatics priorities are changing to the reverse. Abstract grammars are much too clumsy to model morphogrammatics. Hausser’s Domino Approach on the other hand seems to be quite natural.
Hence, an application, which always is a transformation of the concept too, to morphogrammatics is reasonable and technically helpful.

The algorithm of Left-Associative Grammar (LA-grammar, TCS’92):
"LA-grammar is based on the principle of possible continuations. This is in contrast to the algorithms commonly used in today’s linguistics, namely Phrase Structure Grammar (PSG) and Categorial Grammar (CG), which are based on the principle of possible substitutions.
"Computing possible continuations models the
time-linear structure of natural language and permits us to handle turn-taking as the interaction of three kinds of LA-grammar, namely LA-hear, LA-think, and LA-speak.” (Hausser)

The first difference, obviously, is that in contrast to LAG, morpgogrammatic continuations are not linear but tabular and retro-grade recursive with multiple simultaneous resultants.
LAGs are designed for a modeling, formalization and computation of natural language with its time-linear structure.
Morphogrammatics is designed to make accessible not spoken language but writing. And writing is not understood in the tradition of subordination of writing under the general laws of spoken language with its ideality of atomicity, linearity and potential realizability in time, space and matter.
Writing for morphogrammatics is not modeled by natural language but by the possibilities of a general economy of writing, i.e. designing and using marks, signs in a pre-semiotic manner. Therefore the abstraction of morphogrammatic continuations is not linear but tabular retro-grade recursive, while linguistic possible continuations are linearly recursive with one or more successors.

The domino model of possible continuations is helpful to move away from the dominance of an alphabet and its rules to generate new constellations. In contrast to the abstract semiotic concatenation, possible continuations are more adjusted to the constellations they are prolongating.

[Graphics:HTMLFiles/Domino Approach to Morphogrammatics_13.gif]

Structure of a morphogram
typeset structure = [typeset structure]

The Schema of Left Associative Concatenation Rules

                <br /> & ...  mg _ 1            mg _ 2 <br />

<br /> LA (MG) = [[[[ mg _ 1 ] + mg _ 2] + mg _ 3] + mg _ 1] + ...  a ^4 b ^4] or [1 ^4 2 ^2 3 ^3 1 ^4 2 ^4]

lenght (MG) = 4 + 2 + 3 + 4 + 4 = 17 <br /> <br /> What ' s the point to chose the LA  &n ...  [[mg _ 1] + [mg _ 2]] + [mg _ 3] + [[mg _ 1] + [mg  _ 2]]

<br /> Are BIN (MG) and LA (MG) morphogrammatically equal ? <br /> <br /> [[[[ mg _ 1  ... > <br /> LA is botton up, BIN is top down .    Are they morphogrammatically symmetric ?

Combinatory logic
From a formal point of view of term calculi he answer is clear. The combinator S is transforming the formula "(x(y(z))" into the equivalent formula "xz(yz))".

Combinator S: S(xyz) = xz(yz))

[Graphics:HTMLFiles/Domino Approach to Morphogrammatics_20.gif]

1.2.  Structure of morphogrammatic continuations

In contrast to semiotic prolongations or continuations, morphogrammatic continuations are retro-grade recursive depending on the morphogram and its monomorphies to be prolongated.

       semiotic concatenation   <br />       ...              morphogram     

<br />    chiastic change of morphograms and monomorphies <br /> <br />    ... script[<--,      change     ]    monomorphy

2.  The Metaphor of Dominoes

Trained as Westerners we are easily trapped into a way of thinking, which is determined as system of linearly structured signs, objects and operators. This is perfectly studied in disciplines like the theory of formal systems, logic, programming languages and more. Postmodern thinking, art, music, theater and dance tried to escape this terror to linearization and atomization. Modern physics and computer science are still dominated by Western logocentrism. Even if that is rejected as philosophical aestheticism.

This paper tries to give a gentle introduction to a difficult stuff that is in fact very simple presumed we are not being terrorized by linearity and are free to play a game of different form.
Therefore, I recommend to use the game of Dominoes as a metaphor to enter the game of morphograms.

"Each piece you add must be compatible with the previous one, and it in turn determines what can be added next. This is the idea of possible continuations. The continuation approach is based on linear order of concrete pieces (word forms): The next piece con only be added at the end of the sequence.”' (Hausser)

"Each domino is a rectangular tile with a line dividing its face into two square ends. Each end is marked with a number of spots (also called pips) or is blank. The backs of the dominoes in a set are indistinguishable, either blank or having some common design.”

"The line of play is the configuration of played tiles on the table. Typically it starts with a single tile, from which it grows in two opposite directions when the players add matching tiles.”  (WiKi)

A start is arbitrary, it is defined by the start of the game not by its structure. Hence any, possible continuation is following this arbitrary start. We might say, a start is not pre-given to the player but the player are encountering the specific start.

A domino consists of two “monomorphies” with a range of 0 to 6 spots. A domino is linearly ordered in two directions with a 2-“end”(or head and tail) partition.
The back of a domino is not involved, syntactically, into the game. But it might be of significance for the players. Or it might be used to substitute a domino of the same spots.

There are also dominoes of multi-colored tiles in one set. This could lead to interesting speculative extensions of the original singular game towards a complex game of overlapping dominos.

The figure and number of the spots of a domino is stable. Hence, no prolongation of a domino by other dominoes will change the pattern of the starting domino. The same holds for the added domino. It will stay stable and not change by concatenation. The only variability possible is to change a domino of one back color with one of another back color. But this possibility is in fact not covered by the rules of the game.

2.1.  Prolongations and reflections

What can be done? What is an easy operator on morphograms?
Like dominoes, you can reverse your morphogram, rev(aabbcc) = (ccbbaa). Obviously they are different and if the first is not fitting to the domino pattern, then the reverse might. Otherwise you have to use another domino.

But for morphograms things are different:
rev(aabbcc) = (ccbbaa), but (aabbcc) =MG (ccbbaa), hence

rev(rev(aabbcc)) = rev(aabbcc).

Obviously, the trick is a symmetry of the morphogram, therefore we state:

typeset structure

The first case is trivial:
mgtypeset structure=typeset structure, ken(mg1) =typeset structure: ==> refl(mg1) =typeset structure,
mgtypeset structure=typeset structure, mg1 =typeset structure: ==> mg1 =typeset structure.
Example: (aa, bbbb, aa) ==> ref(aa, bbbb, aa) = (aa, bbbb, aa).

The second hints to a morphogrammatic abstraction:
mg1 =typeset structure, ken(mg1) != typeset structure: ==> refl(mg1) =typeset structure,
mgtypeset structure=typeset structure, mg1 !=typeset structure: ==> mg1 =typeset structure.
Example: (aa, bbbb, cc) ==> ref(aa, bbbb, cc) = (cc, bbbb, aa) = (aa, bbbb, cc).

A morphogram consists of monomorphies.

In the example,
(aa, bbbb, cc) : [mg1 mg2 mg3]
rev (aa, bbbb, cc) = (cc, bbbb, aa) : [mg1 mg2 mg3]

And [mg1 mg2 mg3] =MG [mg1 mg2 mg3].

Thus we learn, the identity of the element of a monomorphy are not involved into the game. What counts is the pattern, i.e. the monomorphy, they are indicating.

This experience, that  [mg1] =MG [mg3], or more concrete, that [aa] =MG [cc] is leading for the whole of morphogrammatics.

A single domino, or a single morphogram, is not yet enabling an interesting game.
Like dominoes have prolongation, similar holds for morphograms.

We might like to prolongate a morphogram.
Take the former example: MG1= [mg1 mg2 mg3].
A prolongation of MG1is possible at all places of monomorphies. Hence, the morphogram MG1is not simply getting a linear successor, like for numbers or words of a grammar, but each monomorphy offers the chance of prolongation. This is also in strict contrast to multi-successor systems and many-valued set theories. Multi-successor systems are not referring to their applicant but are adding arbitrary successors out of a given alphabet. Another difference to mark is that the applications for multi-successor system don’t hold simultaneous but are build a set of results.

 <br />            Global change <br /> &nbs ...                                  ------                                         [c]

The order of the collection of prolongations is arbitrary.

We start with the monomorphy [a] of the morphogram [abbc]:
[a] gets a prolongation with [a], i.e. with itself.

[a] gets a prolongation with [b], i.e. because [a] is morphogrammatically equal [b],
[a] gets a prolongation with [c], i.e. because [a] is morphogrammatically equal [c],
[a] gets a prolongation with [d], i.e. because [a] is morphogrammatically equal [d],

All three cases are accepting the structure of the monomorphy [mg1], i.e. its monadic structure indicated by the monad [a]. Furthermore, they are reflecting the structure of the whole morphogram, which is represented by the marks a, b, c. These marks are called kenograms to mark the difference to signs, which are ruled by identity.

But this not yet the whole story:
[a] gets a prolongation with [d], i.e. because [a] is morphogrammatically equal [d].
Now, it would be natural to continue with [e], [f], ...,[x], and whatever marks. But this is natural only for signs of an alphabet and the rule of identity.
For morphograms, [d] is morphogramamatically identical to [a], this would be true for other atomic marks, but [d] is indicating a new realization of the monomorphy [a]. And all other candidates would simply do the same. Therefore, it is enough that one monad, not included in the morphogram [abbc] is doing the job. Only by convention of a lexical order, [d] is chosen.

The exercise goes on with the monomorphies mgtypeset structure= [bb] and mg3= [c].

This, the prolongation of the morphogram MG1, gets some more prolongations with the monomorphies [mgtypeset structure], all together are producing:

Prolongations of MG1= [abbc]:
[a] => [a], [b], [c] and [d]
[bb] => [aa], [bb], [cc] and [dd], and
[c] => [a], [b], [c] and [d].

    <br />     Reduced prolongations by local rules <br />   ...                                  ------                                         [c]

This kind of mophogrammatic continuations are defining an important departure from the prolongation rules of our introductory metaphor, the domino game. The domino game allows only a very restricted set of possible continuations. Morphogrammatic continuation is not restricted to head-tail concatenations but is also allowing continuations from every monomorphy of the morphogram.

2.1.1.  Notations for morphograms

Start with a morphogram  a bb c =                                                              ... ;  b        ø          d

Table for cont (MG) : <br /> MG = a   b   c                                                    ...                                                                                                  3

2.1.2.  Cellular notation

The cellular notation might prepare for a further formalization and programming of morphogrammatics in the framework of cellular automata.

    O    a    O     => O    a    O      O    b    O ...                              aa   O    O                     bb   O    O               cc   O    O

<br /> Prolongation algebra <br />       O     mg1   O   => O      ...                                                                                    mg2   O     mg3

Normalizations  b a bb c  = O    b    O     => O    a    O     O     mg ...   mg1   O               bb   O    c                     aa   O    c               mg2   O     mg3

There might be reasons to domesticate the neighbor pattern  with the same kenograms, but equally, such a domestication might be refused with the insistence on the difference granted by the different locus the neighbor monomorphy occupies.

O    a    O     => O    aa   O ,          ...    mg1   O  bb   O    c    c                     bb   O    cc                     mg2   O     mg3

<br /> Further examples <br /> MG = [abbc][c] <br />                                           ...        ø          ø

2.2.  Coalition as addition

Example <br /> MG  _ 1 = [abba], MG  _ 2 = [a] <br /> [abba] + [a] : <br />    ... bsp;      ø          ø

As for the kenomic notation of prolongations, the monomorphic prolongations are restricted retro-grade to the morphogram. The monomorphic aspect is abstracting from the iterative/accretive distinction crucial for kenomic prolongations.

2.3.  Simultaneity

Hence, the full and only possible prolongations are defined by the occurring monomorphies of a morphogram.

I have demonstrated the possible prolongation of the morphogram successively. But for conceptual reasons we have to accept the simultaneity of all the prolongations possible.
A successiveness would involve time. But there is no time necessary at the time now.
The prolongations are also not collected as a set or a heap, but as a complexion.

For advanced students I might mention the fact that a formalization of the simultaneity of prolongations is well done by category-theoretic interchangeability. There are many ways to model the described situation. To simplify the case I will chose a mix of iteration and mediation.

   <br />           Interchangeability   of  ...                  3                                       3                                       3

    <br />           Interchangeability ...     3                                                                                            3

Properties of prolongation
In contrast to semiotic concatenation, i.e. the operation of connecting two sign sequences linearly together to produce a new sign sequence (word) out of both, the range morphogrammatic prolongation is depending directly on the morphogram (pattern) to be prolongated. All other arbitrary prolongations of the morphogram would be redundant, i.e. repeating a result already produced.

This property of morphogrammatic prolongations is called retro-grade recursivity.
Morphogrammatic prolongations are not only recursive, i.e. iterating abstractly the rules and objects, but are concretely determining retro-grade the range of the iteratively applied rules by the morphogram to be prolongated. Etymologically speaking, the term retro-grade recursivity sounds like a pleonasm: retro-re-current

2.4.  Cooperations of morphograms

If we have constructed an idea of morphogrammatic prolongations, it seems to be straight forward to try it with morphogrammatic “addition”, i.e. building of coalitions, and furthermore to introduce morphogrammatic “multiplication”, i.e. cooperations.

2.4.1.  Multiplication

typeset structure

typeset structure

typeset structure

2.4.2.  Substitution

Substitution, a retro-grade context depending operation
A next step which goes more into the mysteries of morphogrammatics, albeit well prepared by addition, is to define substitution of monomorphies in morphograms.
With the use of dominoes it is obvious that, e.g. a damaged domino might be replaced by another domino of the same form without changing the existing constellation.

typeset structure

typeset structure

typeset structure
typeset structure

typeset structure

2.5.  The magic of morphograms

2.5.1.  More operators: chaining and fusion

There is a lot of magic with morphograms and morphogrammatics. But with the introduction of further operators, this magic gets some mind-boggling surprises.

Until now, our game lived from the fact that two morphograms are equal if they are at least of the same length.

But there is no need for such restricting conditions.

Take two automata. Both are doing the very same job, i.e. you cannot distinguish the results of the automata. They are the same. And as a user of the automata, that’s all you need.
Your question is: What are they doing?

You are not asking: How are they doing it?

Hence, it is easily possible, that both automata, albeit doing the same, are doing it very differently. The structure of the automata might be different but their behavior might be the same.

Because morphograms don’t have a representation in semiotics, they are in fact not given to any perception. Hence, what we can study is their behavior and interactions.

From the point of view of semiotics it is nonsense to state that two sign sequences might be equal if they are not at least of the same length.

That ecaxtly is the magic we experience with morphograms, they might be equal even if they are of different length.
In other words, they might be the same even if their structure is of different complexity. What only counts, is their behavior.

The behavior of morphograms is mirrored by their operators and morphograms as ”objects” are at the end inscribed as operators and not as sequences of signs.

Hence, two new operators, chaining and fusion, added to concatenation, will be involved to create the real magic of morphograms.

We even might speculate, that the new morphogrammatics starts with the magics, and everything else then is a derivation or reduction of this magic constellation, the theorem of bisimilarity, i.e. of behavioral equivalence of morphograms.

I will not follow the obvious but tricky question: Are then morphograms in fact machines?

2.5.2.  Morphogrammatic bisimularity

The trick to show the equality of dominos of different length doesn't work properly with physical dominos. A virtual representation of the dominos and some new rules would be required do it.

Hence, abstractions to define the length of morphograms happens over the group of possible operators and not, like for semiotics, on sets and equivalence relations over sets of signs. The operators are acting in the background as the hidden agents, the morphograms and the result of equivalence is a visible event.

A first striking result of such an application is the intriguing insight and construction of the possibility of the sameness, i.e. a bisimilarity, of morphograms of different kenomic length.

The prolongation of a domino chain is in fact not a simple concatenation or addition of the dominos. The tail of the chain and the head of the new domino have to be the same. This is defining a chain. But because of technical reasons, the overlapping of dominos, it is realized or played as a concatenation.

chain([aab] [abbbcc]) => [aabaaacc].

length(MG1, MG2) = length(MG1) + length(MG2)
length(MG1, MG2) = length(MG1) + length(MG2) - 1
length(MG1, MG2) = length(MG1) + length(MG2) - n,  2 <= n <= length(MG1)

Therefore, monomorphy-based morphogrammatics starts with a bisimilarity theorem (Kaehr 1992) :

Theorem 1:Two morphograms are the same iff they are decomposable into the same monomorphies.

In other words: Two morphograms are the same iff they behave the same.  

A = [abba], B = [aba]
Morphograms A and B are morphogrammatically the same iff they are decomposable into the same monomorphies.

The operators of composition (Vk, Vs) and of decompositions (EVk, EVs) are well defined operators of morphogrammatics. Hence, the abstraction over the interaction of the operators of composition and decomposition is well defined too.

Vk : concatenation (Verknüpfung)
Vs : melting, fusion (Verschmelzung)
EVk: concatenative decomposition (Entknüpfung)
EVs: melting decomposition (Entschmelzung)

A = [abba], B = [aba]
EVk(A) = {[ab], [ab]}
EVs(B) = {[ab], [ab]}
Vs([ab], [ab]) = [aba]
Vk([ab], [ab]) = [abba].

<br /> Existence <br />   ∃ A , B :   A !~=  _ MG B   =>   A   ~=  _ BIS  B . <br />

There exist morphograms A, B, such that if the morphograms A and B are not morphogrammatically identical, there exists a bisimilarity between the morphograms A and B.

Recall, for identities: A = C, B = C => A = B

The morphogram A is defined as a concatenation (addition) Vk of [ab] and [ab], i.e. [abba].
Trivially, the reverse of the addition EVk of A is producing {[ab], [ab]} = C.

      A = Vk([ab],[ab] )= [abba]  iff  EVk(A) = { [ab], [ab]}

Similar for the morphogram B.
The morphogram B is defined as a fusion (overlapping) Vs of [ab] and [ab], i.e. [abba]  
Trivially, the reverse of the overlapping  EVs of B is producing { [ab], [ab]} = C.

Hence for both morphograms A and B:
    B = [aba] = Vs([ab], [ab]) iff  EVs([aba]) = { [ab], [ab]}.

<br /> Therefore : There exists a bisimilarity of A and B <br />  <br />    ∃ A, B : A !~=  _ MG B <==> A ~=  _ BIS  B    <br />

Again, that is : If [abba] !=  _ MG[aba] , then there exists a bisimilarity  &nbs ... xF3A0; _ BIS[aba], then there exists morphograms A and B with    A !~=  _ MG B .

Monomorphies in this example are considered with structure, e.g. [ab], while a decomposition into monomorphies by Dec would produce non-structured monomorphies:
Dec(A) = {[a], [bb], [a]} and Dec(B) = {[a], [b], [a]}.

All together is shown in the diagram:

[Graphics:HTMLFiles/Domino Approach to Morphogrammatics_64.gif]


"To a user, again, the state may remain hidden, it is irrelevant, as long as the automaton implements the desired regular expression. Again, two states may be identified, they behave the same way on the same input, which is to say, if they cannot be distinguished by any observation.“ (Peter Gumm)

Therefore, we have not to know the internal structure of the morphograms A and B. What we observe are the results of the operations EVk applied to A and EVs applied to B. Both results are equal. Hence, A and B are behavioral equivalent.

2.5.3.  Bisimilarity and interchangeability

A poly-categorical thematization of monomorphy-based morphogrammatic equivalence shall be introduced.
How might this morphogrammatic interaction be caught by poly-categories and interchangeability?

Both type of interactions are structurally discontextural (disjunct) but mediated, i.e. typeset structure,
with Vk, EVs∈ typeset structureand Vs, Vk ∈ typeset structure. Both, typeset structure1and typeset structure2 are universes (contextures) of a polycontextural theory.
Both interactions, concatenation (Vk) and melting (Vs) as well as de-concatenation (EVk) and de-melting (EVs) are holding simultaneously, therefore they have to be mediated (typeset structure) to stay in the game, i.e. typeset structure.

Hence, a formalization as an interchangeability of composition and mediation in respect of the operations (Vk, Vs, EVk, EVs) applying to A and B seems natural.

EVk(A) ~= EVs (B) ==>  Vs(EVk (A)) ~= Vk(EVs (B))

    <br />        Example : <br />    & ...   2                                                                           2                 2

Because of the super-additivity of polycontextural mediations, the third system (contexture) has to be considered. It represents the contexture where the result of the interplay of the two contextures is explicitly stated, i.e. that, on the base of the interchangeability of the two contextures, the morphograms, A and B, are behaviorally equivalent. In other words, the interchangeability game of the two involved contextures gets a reflection, i.e. a own location where this interplay is thematized with the question of sameness of differentness of the involved kenomically different morphograms. In this sense, the third system (contexture) is reflecting and mediating the two mediated contextures.

3.  Memristics

3.1.  Memristics, the idea

It wouldn’t be worth the efforts to study such tedious games, like morphogrammatics, if there wouldn’t be a chance to apply it to some interesting real world requirements.
Luckily, there is an intriguing chance to speculate an application for memristive systems.
Hence, from dominos to morphogrammatics to memristics. That’s the new scenario of exiting games.
As we learned with domino games and more explicitly with morphogrammatics, prolongations are fully determined by their history. Prolongations for morphograms are not products of an “abstraction of potential iterability" (Markov), which is abstracting from all limitations forced by matter, space and time.
Morphogrammatic prolongations are resource aware, bound by their own history of production.

A similar situation happens for memristive systems.

Hence, a modeling of “time- and history dependence” is naturally realized with morphogrammatic prolongations and their applications to coalitions and cooperations and more.

"Short for memory resistance, memristance is a property of an electronic component that lets it remember (or recall) the last resistance it had before being shut off.”

Check “Memristics: Memristors, again?” at:

A compilation of the characteristics of the behavior of memristive systems is stated as follow:

"A finite state machine has a state but not a memory of a state.
A memristive machine has a state of a state, i.e. a meta-state as a memory, therefore a memristic machine is not a finite state machine.
A meta-state always can be taken as a simple state in the sense that a reduction from an as-abstraction to an is-abstraction is directly possible because the necessary informations are stored in the meta-state. From “x as y is z” there is an easy way to reduce it to “x is x”. Such a reduction of a second-order system to a first-order system is nevertheless losing the essential features of the reduced system.” (Kaehr)

Towards Abstract Memristic Machines
A helpful “orientation” to the topic of memristics is avaiable at:

3.2.  Memristics, some formalizations

What is considered at this place are not questions about electronics, i.e. resistance, capacitance or inductance, but the structure of transitions within memristive systems. Therefore, the structure of the “time- and history-dependence” of memristive behaviors are in focus.
Following what we learnt about morphogrammatics, prolongations are retro-grade recursively connected with the morphogram to be prolongated.
As a possible interpretation of morphograms for memristive behaviors, I propose to interprete the morphogram [aa] by the memristic structure [M|r1r1] or short [M|r1.1]. The morphogram [ab] then corresponds to [M|r1r2] or short  [M|r1.2].
The same holds for [aba] ==> [M|r1r2r1] and [aab] ==> [M|r1r1r2].

A more explicit notation for a memristic complexion typeset structure shall be:

typeset structure

3.2.1.  Prolongations

Morphogrammatic prolongation

typeset structuretypeset structure

typeset structure typeset structure  typeset structure

typeset structuretypeset structure

typeset structure typeset structure  typeset structure

Memristic prolongation

typeset structuretypeset structure typeset structure

[Mtypeset structure|rtypeset structure] typeset structure [Mtypeset structure|rtypeset structure]

typeset structuretypeset structure typeset structure

typeset structure  typeset structure  typeset structure

[Mtypeset structure|rtypeset structure] typeset structure [Mtypeset structure|rtypeset structure]

typeset structuretypeset structure typeset structure

A memristive system may have the complexity: [M |r1223], then all possible memristive continuations of its behavior are given by the morphogrammatic continuation operations on [M |r1223]. All other continuations would appear as artificial or redundant, e.g. [M |r1223] => [M |rtypeset structure], instead of [M |rtypeset structure] =typeset structure. Redundancy is an important feature in another consideration.

3.2.2.  Cooperations

typeset structure

Memristic cooperation

typeset structure

typeset structure,

typeset structure

with   [ [r   r  ]                 [ r   r  ]        ...                                                                                 3                4

Morphogrammatic multiplication for  kmul([abb], [aba])   = kmul                                ...                                                                               3           3     O

<br /> Field of memristivity for MEM : <br /> <br /> [ r   r   r  ] [r ...          3           3              1           2           2                                    O

     <br />      Field of memristivity of    ...                    O                    O                    O                              5.6 .6

<br />                                          (3, 4)                                         ...                    1.2 .2             3.4 .4                 5.6 .6                         1.2 .2

3.2.3.  Memristic bisimilarity

           <br />      B ...                                                      1           2                   1           2

3.3.  Philosophical remarks on time

Why is time crucial?

It was shown that the behavior of memristors is time-dependent in the sense that each change of memristance is retro-grade mediated with the last state of the memristive system. Hence, temporality of memristive behavior is not conceived by the physical Newtonian time structure but in a “historical”, i.e. self-referential and retro-grade time setting of the events. This structuration of events into retro-grade time dimensions is well modeled with the concept of morphogrammatic prolongation, which has in itself an organization of retro-grade tabular recursivity.

But time is much more complex. Time is not anymore conceived as a stream but as a field. Husserl has shown that time-consciousness demands for a two-dimensionality of a "Längsintentionalität” and “Querintentionalität” of the time-structure even for subjective awareness of time. Intersubjective time-structures are demanding for complex time-fields.

A very first approach to such a 2-dimensional organization of time for physical systems is proposed with the “multiplication”, i.e. cooperation of memristive behaviors. Such cooperation is designing a field of memristivity of a complexity depending on the actors of cooperation. But there is no need to restrict the temporality of the cooperativity of memristive systems to 2-dimensionality only.

Husserl on time
"Bergson, James and Husserl realized that if our consciousness were structured in such a way that each moment occurred in strict separation from every other (like planks of a picket fence), then we never could apprehend or perceive the unity of our experiences or enduring objects in time otherwise than as a convoluted patchwork.
To avoid this quantitative view of time as a container, Husserl’s phenomenology attempts to articulate the conscious experience of lived-time as the prerequisite for the Newtonian, scientific notion of time’s reality as a march of discrete, atomistic moments measured by clocks and science.”

Husserl’s Längsintentionalität and Querintentionalität
"The living-present marks the essence of all manifestation, for in its automatic or passive self-givenness the living-present makes possible the apprehension of the elapsed phases of the life of consciousness and thereby the elapsed moments of the transcendent spatio-temporal object of which the conscious self is aware. This is possible, Husserl argues, because the “flow” of conscious life enjoys two modes of simultaneously operative intentionality.
"One mode of intentionality, which he terms
Längsintentionalität, or horizontal intentionality, runs along protention and retention in the flow of the living-present.
The other mode of intentionality, which Husserl terms the
Querintentionalität, or transverse intentionality, runs from the living-present to the object of which consciousness is aware.”

[Graphics:HTMLFiles/Domino Approach to Morphogrammatics_120.gif]

"Rather than being a simple, undivided unity, self-manifestation is consequently characterized
by an original complexity, by a historical heritage. The present can only appear to
itself as present due to the retentional modification. Presence is differentiation; it is only in
its intertwining with absence.”
(Derrida 1990, 120)."

If there will be a new wave of Artificiality research of cognition & volition and robotics based on memristive technology, it will be confronted with new challenges of time, logic and computation. Contributions to morphogrammatics and polycontextural diamond category theory might offer some orientations.