Exploring programmable self-assembly in non-DNA based molecular computing

DOI10.1007/s11047-013-9397-2zbMath1333.68112arXiv1309.6449OpenAlexW3101545954MaRDI QIDQ269774

Germán Terrazas, Hector Zenil, Natalio Krasnogor

Publication date: 6 April 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6449

zbMATH Keywords

complex systemsmolecular computingcomplex behaviour analysisself-assembly systems

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of Benenson automata
• The program-size complexity of self-assembled squares (extended abstract)
• Clustering by Compression
• The Similarity Metric
• Combinatorial optimization problems in self-assembly
• Principles of Interactive Computation
• Running time and program size for self-assembled squares
• Information Distance in Multiples
• On the Length of Programs for Computing Finite Binary Sequences
• DNA Computing
• Kolmogorov complexity and cellular automata classification

This page was built for publication: Exploring programmable self-assembly in non-DNA based molecular computing