Team behaviour in eco-grammar systems
Theoretical Computer Science
Design, observation, surprise! A test of emergence
Artificial Life
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Function-dependent teams in eco-grammar systems
Theoretical Computer Science
Formal languages and their relation to automata
Formal languages and their relation to automata
Turing's three pioneering initiatives and their interplays
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 0.00 |
The contribution provides an example of how a formal model of some life-like functions – the so called eco-grammar (EG) system – provides a framework in which it is formally provable that the computational power of the model – under some very natural circumstances derived from the specificities of living systems, esp. from their embodiment – may overcome the computational limits of traditional computing models, perhaps also the computational power of the universal Turing machine.