- switchers from the freedom sector of the graphic lambda calculus, the main ingredient in the construction of controlled synapses for B-type NN described previously
- zippers, this time written with the conventions of the Chemical concrete machine minimal formalism.
If we put them together then we obtain graphs like this: (ignore for the moment the red and green curved arrows, suppose they are not there)
Now, if we want the numbering 1-1′ 2-2′ 3-3′ to make sense, we may add arrows, the green and red ones. But mind you, we could also add graphs with one input and one output instead of each green or red arrow. As usual, the colours are just a visual help, they mean nothing in the formalism.
Is just a play, but for the moment, since it’s holiday season, I like to think about the green and red arrows (in fact about their replacements by graphs with one input and one output) as being the letters A, C, G, T. Of course, it might mean nothing, let’s see, it’s just a vague hypothesis.
Left for play: draw a Holliday junction.