On a simple combinatorial structure sufficient for syblying nontrivial self-reproduction

Journal of Cybernetics

Volumn 6, Issue 1-2, 1976, Pages 101-137

  Priese, Lutz ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1642319913     PISSN: 00220280     EISSN: None     Source Type: Journal    
DOI: 10.1080/01969727608927527     Document Type: Article

References (42)

1. Almoroso, S. and Cooper, G. 1971. Tessellation structures for reproduction of arbitrary pattern. J. Comput. Syst. Sci. 5: 455-464.
2. Arbib, M. A. 1968, Self-reproducing automata-some implications for theoretical biology. In Towards a theoretical biology II, ed. C. H. Waddington, pp. 204-226, Edinburgh: University Press.
3. Banks, E. R. 1971. "Information Processing and Transmission in Cellular Automata. " Ph. D. thesis, MIT, Project MAC, MACTR-81.
4. Bennett, C. H. 1973. Logical Reversibility of Computation. IBM J. Res. Dev. 525-532.
5. Burks, A. W., ed., 1970. Essays on cellular automata. Urbana: University of Illinois Press.
6. Codd, E. F. 1968. Cellular automata. New York: Academic.
7. Commoner, F., Holt, A. W., Even, S. and Pnueli, A. 1971. Marked directed graphs.Comput. Syst. Sci. 5: 511-523.
8. Dennis, J. B. 1970. Modular, asynchronous control structures for a high performance processor. In Record of the project MAC conference on concurrent systems and parallel computation, ACM-Record, pp. 55-80, New York.
9. Gardner, M. 1970. Mathematical games. Sci. Am. 223.
10. Gardner, M. 1971. Mathematical games. Sci. Am. 224.
11. Gödel, K. 1931. Uber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatsh. Math. Phys. 38: 173-198.
12. Hack, M. H. T. 1972. Analysis of production schemata by Petri-nets, MIT, Project MAC, MAC TR-94.
13. Hack, M. H. T. 1975. Petri-net languages. MIT, Project MAC, Computation Structure Group, Memo 124.
14. Herman, G. T. and Schiff, G. L. 1975. Simulation of multi-gradient models of organisms in the context of L-systems. J. Theor. Biol. 54: 35-46.
15. Jacobson, H. 1958. On models of reproduction. Am. Sci. 255-284.
16. Kitagawa, T. 1974. Cell space approaches in biomathematics. Math. Biosci. 19: 27-71.
17. Kleene, S. C. 1971. Introduction to Metamathematics. Amsterdam: North-Holland.
18. Laing, R. 1975. Some alternative reproductive strategies in artificial molecular machines. J. Theor. Biol. 54: 63-84.
19. Lee, C. Y. 1963. A Turing machine which prints its own code-script. In Proceedings of the symposium on mathematical theory of automata, ed. J. Fox, pp. 155-163. Brooklyn: Polytechnic Press.
20. Löfgren, L. 1972, Relative explanations of systems. In Trends in general systems theory, ed. G. Klir, pp. 340-407. New York: Wiley.
21. Lück, H. B. 1975. Elementary behaviour rules as a foundation for morphogenesis. J. Theor, Biol. 54: 23-34.
22. Markov, A. A. 1954. Theory of algorithms. Academy of Science of the USSR. Translated from Russian. (Published by the Israel Program for Scientific Translations, Jerusalem, 1962.)
23. Minsky, M. L. 1962. Size and structure of universal turing machines using tag systems. In Recursive function theory, proceeding of symposia in pure mathematics 5, ed. J. Dekker, pp. 229-238. New York: AMS.
24. Morowitz, H. J. 1959. A model of reproduction. Am. Sci. 47: 261-263.
25. Myhill, J. 1970. The abstract theory of self-reproduction. In Essays on cellular automata, ed. A. W. Burks. Urbana: University of Illinois Press.
26. von Neumann, J. 1966. Theory of self-reproducing automata. Urbana: University of Illinois Press.
27. Ostrand, T. J. 1971. Pattern reproduction in tessellation automata of arbitrary dimension. J. Comput. Syst. Sci. 5: 623-628.
28. Patil, S. S. 1970. Coordination of asynchronous events. MIT, Project MAC, MAC TR-72.
29. Penrose, L. S. 1958. Mechanics of Self-Reproduction. Ann, Hum. Genet, 23: 59-72.
30. Penrose, L. S. and Penrose, R. 1957. A self-reproducing analogue. Nature 179
31. Petri, C. A. 1962, Kommunikation mit Automaten, Schriften des Rheinisch-Westf. Institutes für instrumentelle Mathematik an der Universität Bonn, 2.
32. Post, E. L. 1943. Formal reduction of the general combinatorial decision problem. Am. J. Math. 65: 197-215.
33. Priese, L. 1974. "Uber einfache unentscheidbare Probleme: Computational-und constructional-universelle asynchrone cellulare Automaten. " Ph. D. Thesis, Universität Münster.
34. Priese, L. 1976. Reversible Automaten und einfache universelle 2-dimensionale Thue-Systeme. Zeitschrift für math. Logik und Grundlagen der Mathematik. (In press.)
35. Rozenberg, G. and Salomaa, A. 1974. L systems, lecture notes. Comput. Sci. 15.
36. Smith, A. R. 1968. Simple computation universal cellular spaces. J. Ass. Comp. Mach. 18: 339-353.
37. Thatcher, J. W. 1962. The construction of a self-describing turing machine. In Proceedings of the symposium on mathematical theory of automata, ed. J. Fox, pp. 165-171. Brooklyn: Polytechnic Press.
38. Winograd, T. 1967. A simple algorithm for self-reproduction. Project MAC, MIT, Artificial Intelligence Memo No. 197.
39. Wolpert, L. 1969. Positional information and the spatial pattern of cellular differentiation. J. Theor. Biol. 25: 1-47.
40. Yoeli, M. 1973. Petri nets and asynchronous control networks. Dept. Appl. Comput. Sci. Res. Rep. CS-73-07.
41. Zeleznikar, A. P. 1963. Some algorithms and its applicability. Glas. Mat. Fiz. Astron., Ser. 2 18: 141-158.
42. Zeleznikar, A. P. 1967, Overlapping algorithms. Math. Syst. Theor. 1: 325-345.