ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
DOI10.1080/01969727608927527zbMATH Open0359.02048OpenAlexW1975631682MaRDI QIDQ4132520FDOQ4132520
Authors: Lutz Priese 
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) General biology and biomathematics (92B05) Thue and Post systems, etc. (03D03) Applications of computability and recursion theory (03D80)
Cited In (7)
- A universal machine without change of state
- UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
- Conservative logic
- Bicontinuous extensions of invertible combinatorial functions
- A note on asynchronous cellular automata
- Construction universality in purely asynchronous cellular automata
- Reversible spiking neural P systems
This page was built for publication: ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132520)
