Self-assembly and differentiation as models of computability

DOI10.1007/BF02463492zbMath0377.94063WikidataQ44990443 ScholiaQ44990443MaRDI QIDQ1246413

Robert M. Baer

Publication date: 1975

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

92B05: General biology and biomathematics

03D10: Turing machines and related notions

Related Items

Computation by assembly

Cites Work

• The halting problem for linear Turing assemblers