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,...

Descripción completa

Detalles Bibliográficos
Autores principales: Dueñas-Díez, Marta, Pérez-Mercader, Juan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2019
Materias:
Article
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

Internet

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