Continues from Ouroboros predecessor (III): the walking machine . This time you have to imagine that the walker machine sits on a long enough train track.
The regularity of the train track is corrupted by a bit of food (appearing as a L node connected to a termination node), see the next (BIG) picture. It is at the right of the walker.
You can see (maybe if you click on the image to make it bigger) that the walker ingests the food. The ingested part travels through the walker organism and eventually is expelled as a pair L and A nodes.
Perhaps, by clever modifications of the walker (and some experiments with its food) one can make a Turing machine.
This would give a direct proof that chemlambda with the sequential strategy is universal as well. (Well, that’s only of academic interest, to build trust as well, before going to the really nice part, i.e. distrbuted, decentralized, alife computations.)