Cargando…
How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines
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,...
Autores principales: | Dueñas-Díez, Marta, Pérez-Mercader, Juan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6710637/ https://www.ncbi.nlm.nih.gov/pubmed/31442667 http://dx.doi.org/10.1016/j.isci.2019.08.007 |
Ejemplares similares
-
In-vitro reconfigurability of native chemical automata, the inclusiveness of their hierarchy and their thermodynamics
por: Dueñas-Díez, Marta, et al.
Publicado: (2020) -
Automata, languages, and machines
por: Eilenberg, Samuel, et al.
Publicado: (1974) -
Automata, languages, and machines
por: Eilenberg, Samuel, et al.
Publicado: (1976) -
Finite automata
por: Lawson, Mark V
Publicado: (2003) -
Automata and languages
por: Howie, John M.
Publicado: (1991)