How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines
Summary: 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 art...
Main Authors: | Marta Dueñas-Díez, Juan Pérez-Mercader |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2019-09-01
|
Series: | iScience |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2589004219302858 |
Similar Items
-
Turing Automata and Graph Machines
by: Miklós Bartha
Published: (2010-06-01) -
Quantum Turing automata
by: Miklós Bartha
Published: (2014-03-01) -
Hardcoding finite automata
by: Ngassam, Ernest Ketcha
Published: (2013) -
Animating the conversion of nondeterministic finite state automata to deterministic finite state automata
by: Merryman, William Patrick
Published: (2007) -
Human Activity Recognition through Weighted Finite Automata
by: Sergio Salomón, et al.
Published: (2018-10-01)