Comment by encyclopediai

You can play with it. Equivalence with Turing machines is not the point of interest

Sorry about this "not A but B", now is one of those situations where is needed.

Is not:

- cellular automata, - Turing machines

implemented chemically.

The goal, first of UPIM, then chemlambda or chemSKI, is simply to: - find chemical complexes, - or to make them

(though I suspect that we shall discover them in our cells)

so that they enter in random chemical reactions which are akin the graph rewriting inspired by lambda calculus or SKI combinators or Interaction Combinators.

The thesis is that this chemical translation still can do "anything" despite the lack of control of reactions or the combinatorial explosion of possible reaction networks.

Under this thesis we are graph quines.