On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Kolmogorov complexity and cellular automata classification
Theoretical Computer Science
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The computational power of Benenson automata
Theoretical Computer Science
Compression-based data mining of sequential data
Data Mining and Knowledge Discovery
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Information Distance in Multiples
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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.