作者: Alexis Courbet , Franck Molina , Patrick Amar
DOI: 10.1007/S10441-015-9258-8
关键词: Satisfiability 、 Computation 、 Mathematics 、 Massively parallel 、 SIGNAL (programming language) 、 Boolean function 、 Set (abstract data type) 、 Logic gate 、 Theoretical computer science 、 True quantified Boolean formula
摘要: In this article we present a new kind of computing device that uses biochemical reactions networks as building blocks to implement logic gates. The architecture machine relies on these generic and composable blocks, computation units, can be used in multiple instances perform complex boolean functions. Standard logical operations are implemented by networks, encapsulated insulated within synthetic vesicles called protocells. These protocells capable exchanging energy information with each other through transmembrane electron transfer. the paradigm propose, protoputing, solve only one problem therefore has built specifically. Thus, programming phase standard is represented our approach set assembly instructions (specific attachments) directs wiring constitute itself. To demonstrate power protocellular machines, apply it NP-complete problem, known very demanding power, 3-SAT problem. We show how program verify satisfiability given formula. Then use massive parallelism machines less than 20 min all valuations input variables output fluorescent signal when formula satisfiable or no at otherwise.