Article

Complexity through the Observation of Simple Systems

06/2009; DOI: 10.4204/EPTCS.1.3
Source: arXiv

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 context-free 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.

Full-text

Available from: Peter Leupold, Apr 09, 2014
0 Followers
 · 
62 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We survey and extend the 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 purpose an external observer records this behavior. In this way, several computational trade-offs between the observer and the observed system can be determined. 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 context-free grammars with regular observers suffices to obtain computational completeness. As a second instantiation presented here, we apply an observer to sticker systems, an abstract model of DNA computing. Finally, we introduce and investigate the case where the observers can read only one measure of the observed system (e.g., mass or temperature), modeling in this way the limitations in the observation of real physical systems. Finally, a research perspective on the topic is presented.
    Theoretical Computer Science 01/2011; 412(1-2):113-123. DOI:10.1016/j.tcs.2010.05.040 · 0.52 Impact Factor