Landing page for all chemlambda projects
We can program a computer to do anything. What if we had the same power over the molecules of our bodies?
This is a collection of experiments with chemlambda artificial chemistry, interaction combinators and lambda calculus. The goal is to explore the behaviour of such systems under the most simple random algorithms, implemented by local machines. This teaches us something about biological life, or if molecular computers inspired from graph reductions and lambda calculus are possible.
Experiments involve, among others, quine graphs. These are new proposals for artificial life. They can reproduce, die and they have a metabolism. Interesting lambda calculus computations, far more complex than simple circuits logic, can be done with local random rewrites algorithms. Lambda calculus, or more precisely graph rewrites systems inspired from it, can be taken as first principles when designing molecular computers. The simulations from the collection of animations show many examples of complex behaviour typical for living creatures, thus suggesting that real life, at molecular level, is the same kind of computation as (graphical versions of) lambda calculus.
How to ask questions?
Program repositories, in reverse temporal order
Talks, slides, video, discussions
, aka "made of money" (not yet stable): a remake of chemlambda (and arbitrarily many other graph rewrite systems) as a conservative graph rewrite system,
with the help of tokens and permutation based automata. Articles and demos:
Zip Slip Smash
is a rework of zipper logic, in development. More specifically, it combines tangle diagrams with zippers made with the help of directed interaction combinators.
It admits a denotational semantics of a pair of emergent algebras, one linear and the other commutative.
First articles from the initial chemlambda project
Special thanks to the other authors of chemlambda repositories listed here. Their work greatly enhanced this project and also validated it. The discussions, see those listed here or in the issues of the other repositories, helped very much to clarify the subject.
Marius Buliga, 2020-2021. more here