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

DOI10.1007/S11047-013-9397-2MaRDI QIDQ269774zbMATH OpenOpenAlexFDO

Authors 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 systemscomplex behaviour analysismolecular computingself-assembly systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: Self-assembly is a phenomenon observed in nature at all scales where autonomous entities build complex structures, without external influences nor centralised master plan. Modelling such entities and programming correct interactions among them is crucial for controlling the manufacture of desired complex structures at the molecular and supramolecular scale. This work focuses on a programmability model for non DNA-based molecules and complex behaviour analysis of their self-assembled conformations. In particular, we look into modelling, programming and simulation of porphyrin molecules self-assembly and apply Kolgomorov complexity-based techniques to classify and assess simulation results in terms of information content. The analysis focuses on phase transition, clustering, variability and parameter discovery which as a whole pave the way to the notion of complex systems programmability.

Recommendations

• Simulation of programmable matter systems using active tile-based self-assembly
• Active Self-Assembly of Simple Units Using an Insertion Primitive
• TCS special issue on computational self-assembly
• Computational Design of Reaction-Diffusion Patterns Using DNA-Based Chemical Reaction Networks
• scientific article; zbMATH DE number 2086605

Cites work

• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• An evolutionary methodology for the automated design of cellular automaton-based complex systems
• Clustering by Compression
• Combinatorial optimization problems in self-assembly
• Compression-based investigation of the dynamical properties of cellular automata and other systems
• DNA Computing
• Information Distance in Multiples
• Kolmogorov complexity and cellular automata classification
• On the Length of Programs for Computing Finite Binary Sequences
• Principles of interactive computation
• Running time and program size for self-assembled squares
• The Similarity Metric
• The computational power of Benenson automata
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(5)

• scientific article; zbMATH DE number 2086605 (Why is no real title available?)
• Ideas about self assembly
• Automated self-assembly programming paradigm: The impact of network topology
• Self-assembled \(M_{24}L_{48}\) polyhedra and their sharp structural switch upon subtle ligand variation
• Computation = self-assembly + conformational change: Toward new computing paradigms.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269774)