SKI# is a Turing complete, language for programming in the aTAM model. A compilation technique provides a mapping from SKI# into finite sets of DNA Tiles that self-assemble in the aTAM model. Though such sets are always finite, the number of Tiles may be relevant, the construction of the Tiles may be heavy and the self-assembly can produce wrong molecular growth. In this paper we discuss the construction of a DNA Universal Machine as an aTAM interpreter for the entire Combinatory Logic, comparing it with the compiler based approach. Finally, Consensus is considered as a case study in distributed programming in the aTAM model and a further step in the design of SKI# and in the expressivity of aTAM (Wang Tiling) compared to Combinatory Logic and π-calculus. and π-calculus.
Programming Self-Assembly of DNA Tiles
BELLIA, MARCO;OCCHIUTO, MARIA EUGENIA
2014-01-01
Abstract
SKI# is a Turing complete, language for programming in the aTAM model. A compilation technique provides a mapping from SKI# into finite sets of DNA Tiles that self-assemble in the aTAM model. Though such sets are always finite, the number of Tiles may be relevant, the construction of the Tiles may be heavy and the self-assembly can produce wrong molecular growth. In this paper we discuss the construction of a DNA Universal Machine as an aTAM interpreter for the entire Combinatory Logic, comparing it with the compiler based approach. Finally, Consensus is considered as a case study in distributed programming in the aTAM model and a further step in the design of SKI# and in the expressivity of aTAM (Wang Tiling) compared to Combinatory Logic and π-calculus. and π-calculus.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
