Chemlambda, universality and self-multiplication

Artificial Life 14 - Proceedings of the 14th International Conference on the Synthesis and Simulation of Living Systems, ALIFE 2014

Volumn , Issue , 2014, Pages 490-497

  Buliga, Marius ^a   Kauffman, Louis H ^b  

^a ACADEMY OF ROMANIAN SCIENTISTS   (Romania)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL LIFE; BIOLOGICAL SYSTEMS; MOLECULES;

ARTIFICIAL CHEMISTRIES; GEOMETRICAL STRUCTURE; GRAPHICAL LANGUAGES; SPACE AND TIME; TURING-COMPLETE;

C (PROGRAMMING LANGUAGE);

EID: 84978765571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Agha, G. (1986). Actors: A model of concurrent computation in distributed systems. Doctoral Dissertation. MIT Press, (html).
2. Banâtre, J.-P., Coutant, A., and Le Métayer, D. (1988). A parallel machine for multiset transformation and its programming style. Future General Computer Systems, 4:133-144.
3. Banâtre, J.-P. and Le Métayer, D. (1986). A new computational model and its discipline of programming. Technical Report INRIA Report 566.
4. Berry, G. and Boudol, G. (1992). The chemical abstract machine. Theoretical Computer Science, 96(1):217-248.
5. Buliga, M. (2013a). Chemical concrete machine. arXiv:1309.6914.
6. Buliga, M. (2013b). Graphic lambda calculus. Complex Systems, 4:311-360.
7. Buliga, M. and Kauffman, L. (2013). Glc actors, artificial chemical connectomes, topological issues and knots. arXiv:1312.4333.
8. Chen, G., Kauffman, L., and Lomonaco, S. (2007). Mathematics in Quantum Computation and Quantum Technology. Chapman & Hall/CRC.
9. Fontana, W. and Buss, L. (1994a). "the arrival of the fittest": Toward a theory of biological organization. Bull. Math. Biol., 56:1-64.
10. Fontana, W. and Buss, L. (1994b). What would be conserved if the tape were played twice? Proc. Natl. Acad. Sci. USA, 91:757-761.
11. Fontana, W. and Buss, L. (1996). The barrier of objects: From dynamical systems to bounded organizations. In J. Casti and J., Karlqvist, A., editors, Boundaries and Barriers, pages 56-116. Addison-Wesley.
12. Hewitt, C. (2010). Actor model of computation. arXiv:1008.1459.
13. Kauffman, L. (1991). Knots and Physics. World Scientific Pub.
14. Kauffman, L. (1994a). Knot automata. In Proceedings of The Twenty-Fourth International Symposium on Multiple-Valued Logic, Boston, Massachusetts, pages 328-333.
15. Kauffman, L. (1994b). Knot logic. In Kauffman, L., editor, Knots and Applications, pages 1-110. World Scientific Pub.
16. Kauffman, L. and Lomonaco Jr., S. (2006). q - deformed spin networks, knot polynomials and anyonic topological quantum computation. quant-ph/0606114.
17. Lamping, J. (1990). An algorithm for optimal lambda calculus reduction. In POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 16-30.
18. Tschudin, C. (2003). Fraglets - a metabolistic execution model for communication protocols. In Proc. 2nd Annual Symposium on Autonomous Intelligent Networks and Systems (AINS), Menlo Park, USA.
19. Tschudin, C. and Yamamoto, L. (2004). A metabolic approach to protocol resilience. In Proc. 1st Workshop on Autonomic Communication (WAC 2004), Berlin, Germany, pages 191-206. Springer LNCS volume 3457.
20. Wadsworth, C. (1971). Semantics and pragmatics of the lambda calculus. DPhil thesis, Oxford.