Deterministic Autopoietic Automata
    Download PDF
Martin Furer. Deterministic Autopoietic Automata. International Journal of Software and Informatics, 2013,7(4):605~613
Hits: 1338
Download times: 1239
Fund:This research is supported in part by the National Science Foundation under Grants CCF-0728921 and CCF-0964655. Part of this work was done while visiting the University of Z?urich.
Abstract:This paper studies some issues related to autopoietic automata, a model of evolving interactive systems, where the automata produce other automata of the same kind. It is shown how they relate to interactive Turing machines. All results by Jiri Wiedermann on nondeterministic autopoietic automata are extended to deterministic computations. In particular, nondeterminism is not needed for a single autopoietic automaton to generate all autopoietic automata.
keywords:autopoietic automata  evolving interactive systems  interactive Turing machines
View Full Text  View/Add Comment  Download reader



Top Paper  |  FAQ  |  Guest Editors  |  Email Alert  |  Links  |  Copyright  |  Contact Us

© Copyright by Institute of Software, the Chinese Academy of Sciences

京公网安备 11040202500065号