Evidence map›Paper›PMID 31442667›Full record

ArticleiScience2019

How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines.

Marta Dueñas-Díez, Juan Pérez-Mercader

Abstract read
In one paragraph

Article in iScience, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 papers.

0numbers the graph read from it
0cells of the map it votes in
16citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

16 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. ACS omega · 2023
    Article
  6. Article
  7. Article
  8. Article
  9. Thermodynamic State Machine Network.Entropy (Basel, Switzerland) · 2022
    Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Review
  16. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Marta Dueñas-DíezRepsol Technology Lab, c/ Agustín de Betancourt s/n, Móstoles, Madrid 28935, Spain; Department of Earth and Planetary Sciences, Harvard Origins of Life Initiative, Harvard University, 20 Oxford Street, Cambridge, MA 02138, USA.
Juan Pérez-MercaderDepartment of Earth and Planetary Sciences, Harvard Origins of Life Initiative, Harvard University, 20 Oxford Street, Cambridge, MA 02138, USA; Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA. Electronic address: jperezmercader@fas.harvard.edu.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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, table top chemical reactors: from the simplest, Finite automata, to the most complex, Turing machines. Language acceptance/rejection criteria by automata can be formulated using energy considerations. Our Turing machine uses the Belousov-Zhabotinsky chemical reaction and checks the same symbol in an Avogadro's number of processors. Our findings have implications for chemical and general computing, artificial intelligence, bioengineering, the study of the origin and presence of life on other planets, and for artificial biology.

Indexed as

Chemical ReactionChemistryComputer ScienceTheory of Computation

Identifiers

PMID31442667
PMCPMC6710637

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.