Ontology highlight
ABSTRACT:
SUBMITTER: Duenas-Diez M
PROVIDER: S-EPMC6710637 | biostudies-literature | 2019 Sep
REPOSITORIES: biostudies-literature
Dueñas-Díez Marta M Pérez-Mercader Juan J
iScience 20190807
Every problem in computing can be cast as decision problems of whether strings are in a language or not. Computations and language recognition are carried out by three classes of automata, the most complex of which is the Turing machine. Living systems compute using biochemistry; in the artificial, computation today is mostly electronic. Thinking of chemical reactions as molecular recognition machines, and without using biochemistry, we realize one automaton in each class by means of one-pot, ta ...[more]