Automaton introspection

Journal of Computer and System Sciences - Tập 13 - Trang 172-183 - 1976
Richard Laing1
1Logic of Computers Group, Department of Computer and Communication Sciences, The University of Michigan, Ann Arbor, Michigan 48109, USA

Tài liệu tham khảo

Burks, 1961, Computation, behavior, and structure in fixed and growing automata, Behavioral Science, 6, 5, 10.1002/bs.3830060103 Chaitin, 1966, On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach., 13, 547, 10.1145/321356.321363 Chaitin, 1974, Information-theoretic limitations of formal systems, J. Assoc. Comput. Mach., 21, 403, 10.1145/321832.321839 Laing, 1975, Artifical molecular machines: a rapprochement between kinematic and cellular automata, 73 Laing, 1975, Some alternative reproductive strategies in artificial molecular machines, J. Theoretical Biology, 54, 63, 10.1016/S0022-5193(75)80055-5 Lee, 1963, A Turing machine which prints its own code script, 155 Thatcher, 1963, The construction of the self-describing Turing machine, 165 Thatcher, 1970, Self-describing Turing machines and self-reproducing cellular automata, 101 von Neumann, 1966 Wang, 1957, A variant to Turing's theory of computing machines, J. Assoc. Comput. Mach., 4, 63, 10.1145/320856.320867