This is the tutorial page for distributed computing with GLC actors. This page is preserved for reference. This project (GLC) is no longer active, because superseded by chemlambda.
- M. Buliga, Molecular computers, 2015. This is the article which contains the rewrites for chemlambda v2. It is also one of the first articles which “run in the browser”, besides that it offers means for validation instead of the social practice of peer review.
- M. Buliga, Chemical concrete machine, (DOI) arXiv:1309.6914
- M. Buliga, Graphic lambda calculus, Complex Systems 22, 4 (2013), 311-360, arXiv:1305.5786
- M. Buliga, L.H. Kauffman, GLC actors, artificial chemical connectomes, topological issues and knots, arXiv:1312.4333
- M. Buliga, L.H. Kauffman, Chemlambda, universality and self-multiplication, arXiv:1403.8046 , MIT Press article, presented by Louis in the ALIFE 14: The Fourteenth International Conference on the Synthesis and Simulation of Living Systems, July 30th – Aug 2nd 2014, New York
The logo of distributed GLC, chemlambda and graphic lambda calculus (GLC) is this:
TL;DR description of the model.
- decentralized and asynchronous
- based on artificial life
- and actor style, not process calculi style interactions
- to unite the real and the virtual worlds into one, moved by the same real/virtual chemistry, into an ecology where humans bring the meaning by communication.
- with individual molecules from an artificial chemistry, chemlambda,
- each molecule managed by an actor
- interactions between actors like signal transduction, not like the usual sender-channel-receiver.
This computation model has two stages:
- and computation.
In the preparation stage we define the actors, then in the second stage, the actors interact according to 5 rules of behaviour, performing an asynchronous distributed computation.
Principles of distributed GLC: [source]
- done by processing structure to structure (via graph rewrites)
- purely local
- uses an analogy with molecules and chemical reactions, but the spatial relations between the interacting molecules are replaced by actors interactions in a variant of the Actor Model.
What is not:
- the model is not sequential, although it may do sequential computation, if constrained; however, the model does not need the idea of a sequential computation,
- synchronization is not needed for the model, in fact any synchronization hypothesis would only cripple the power of the model,
- this model of computation does not need or use any evaluation procedure, nor in particular evaluation strategies. No names of variables, no values are used.
- the model does not rely on signals passing through gates, nor on the sender-receiver setting of Information Theory.
- Because the eta reduction is not part of the model, no functions are used, needed, or make sense.
- this model of computation is not based on a global picture. There is no global state, no global space, no global time,
- no semantics.
GLC actors and their behaviours. A GLC actor it’s an entity which has some data and 5 possible behaviours. See section 3 from GLC actors, artificial chemical connectomes, topological issues and knots for details and examples.
Data. Every actor has a name. The notation used is that the actor is the name of the actor . Every actor has also, as data, a GLC graph which has some of his half-arrows decorated with names of other actors.
You can use these decorations in order to assembly a big GLC graph from the pieces which reside in all actors data, by gluing the half arrows along the given decorations.
But mind you that the behaviours of actors are not a consequence of the existence of this global object, the big GLC graph.
Behaviours. The main idea is that the graph rewrites of the big GLC graph can be done asynchronously, by purely local interactions between the actors which have the small pieces of the big GLC graph.
There are two types of graph rewrites, which are treated differently. They appear as behaviours 1 and 3.
Behaviour 1: the graphic beta move (and the FAN-IN move if we use chemlambda instead of GLC) is performed between two actors, as a form of interaction between those.
Behaviour 2: name change. An actor can pass one node to another actor. It has to be an actor which he knows, i.e. one which has an address which appears on one of the half-arrows of the mentioned node.
Behaviour 3: FAN-OUT and pruning moves, which are performed internally in one actor.
Behaviour 4: creation of new actors. An actor can split into two, thus he can create a new actor, provided it’s piece of GLC graph has two disconnected parts.
Behaviour 5: interaction with cores. Suppose you use external IT constructs, like databases, counters or other. Call this “cores”. You make an actor from such a core by connecting it to a “mask” (which is GLC graph) and by defining moves which are performed between the mask and the core. Basically such a move means a translation from external format into GLC graphs. This can be always done, because GLC is Turing universal. In the paper is given the example of a counter as a core.