Premium
Computation, behavior, and structure in fixed and growing automata
Author(s) -
Burks Arthur W.
Publication year - 1961
Publication title -
behavioral science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 45
eISSN - 1099-1743
pISSN - 0005-7940
DOI - 10.1002/bs.3830060103
Subject(s) - construct (python library) , automaton , sort , computer science , theoretical computer science , cellular automaton , computation , complex system , order (exchange) , automata theory , algorithm , artificial intelligence , programming language , information retrieval , finance , economics
Abstract The theory of automata is relevant to behavioral science in the sense that it is an absolutely rigorous theory of processes which are themselves absolutely rigorous abstractions of behavior. If we can specify exactly how we wish a system to behave (i.e., what shall happen in response to what), we can in principle construct the system. To what extent, then, can “higher order” systems of this sort be constructed, systems which will construct other systems with prescribed behavior characteristics? In particular, a question which has intrigued automata theoreticians is whether an automaton can be constructed which will reproduce itself and, if so, how complex does it need to be? These questions and related matters are discussed in this article.