ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
From MaRDI portal
Publication:4132520
DOI10.1080/01969727608927527zbMath0359.02048OpenAlexW1975631682MaRDI QIDQ4132520
Publication date: 1976
Published in: Journal of Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969727608927527
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Applications of computability and recursion theory (03D80) General biology and biomathematics (92B05) Thue and Post systems, etc. (03D03)
Related Items
A universal machine without change of state, Construction universality in purely asynchronous cellular automata, Reversible spiking neural P systems, Conservative logic, A note on asynchronous cellular automata, UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA, Bicontinuous extensions of invertible combinatorial functions
