Achieving Operational Universality through a Turing Complete Chemputer

The most fundamental abstraction underlying all modern computers is the Turing Machine, that is, if any modern computer can simulate a Turing Machine, an equivalence which is called "Turing completeness", it is theoretically possible to achieve any task that can be algorithmically described by executing a series of discrete unit operations. In chemistry, the ability to program chemical processes and ensure unit operations are understood at a high level of abstraction and then reduced to practice is extremely challenging. Herein, we exploit the concept of Turing completeness applied to robotic chemical platforms that execute unit operations to synthesize complex molecules using a chemically aware programming language, XDL. We leverage the concept of computability by computers to synthesizability of chemical compounds by automated synthesis machines. The results of an interactive demonstration of Turing completeness using the color gamut and conditional logic are presented to serve as a proxy for conceptual, chemical space exploration. This formal description establishes a formal framework in future chemical programming languages to ensure complex logic operations are expressed and executed correctly, with the possibility of error correction, in the autonomous pursuit of increasingly complex molecules.

Authors

Institutions

Publication Details

Journal
JACS Au
Published
2026-01-12
DOI
https://doi.org/10.1021/jacsau.5c01382
Primary Topic
DNA and Biological Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Achieving Operational Universality through a Turing Complete Chemputer

Dean Thomas, Daniel Gahler, Slawomir Lach, Leroy Cronin
JACS Au
DNA and Biological Computing
article

Achieving Operational Universality through a Turing Complete Chemputer

Dean Thomas, Daniel Gahler, Slawomir Lach, Leroy Cronin
article en

Abstract

The most fundamental abstraction underlying all modern computers is the Turing Machine, that is, if any modern computer can simulate a Turing Machine, an equivalence which is called "Turing completeness", it is theoretically possible to achieve any task that can be algorithmically described by executing a series of discrete unit operations. In chemistry, the ability to program chemical processes and ensure unit operations are understood at a high level of abstraction and then reduced to practice is extremely challenging. Herein, we exploit the concept of Turing completeness applied to robotic chemical platforms that execute unit operations to synthesize complex molecules using a chemically aware programming language, XDL. We leverage the concept of computability by computers to synthesizability of chemical compounds by automated synthesis machines. The results of an interactive demonstration of Turing completeness using the color gamut and conditional logic are presented to serve as a proxy for conceptual, chemical space exploration. This formal description establishes a formal framework in future chemical programming languages to ensure complex logic operations are expressed and executed correctly, with the possibility of error correction, in the autonomous pursuit of increasingly complex molecules.

JACS AuVol. 6(1)
University of Glasgow (GB)
Openalex Percentile: Top 90%
DNA and Biological Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Achieving Operational Universality through a Turing Complete Chemputer — Dean Thomas, Daniel Gahler, et al. · JACS Au (2026) | TGRS Research Map | TGRS