Complexity through the Observation of Simple Systems
Abstract
We survey work on the paradigm called "computing by observing." Its central feature is that one considers the behavior of an evolving system as the result of a computation. To this end an observer records this behavior. It has turned out that the observed behavior of computationally simple systems can be very complex, when an appropriate observer is used. For example, a restricted version of contextfree grammars with regular observers suffices to obtain computational completeness. As a second instantiation presented here, we apply an observer to sticker systems. Finally, some directions for further research are proposed.
 Publication:

arXiv eprints
 Pub Date:
 June 2009
 DOI:
 10.48550/arXiv.0906.3332
 arXiv:
 arXiv:0906.3332
 Bibcode:
 2009arXiv0906.3332C
 Keywords:

 Computer Science  Computational Complexity;
 Computer Science  Discrete Mathematics;
 Computer Science  Formal Languages and Automata Theory
 EPrint:
 EPTCS 1, 2009, pp. 2230