Achieving Operational Universality through a Turing Complete Chemputer

• URL: http://arxiv.org/abs/2502.02872v1
• Date: Wed, 05 Feb 2025 04:06:32 GMT
• Title: Achieving Operational Universality through a Turing Complete Chemputer
• Authors: Daniel Gahler, Dean Thomas, Slawomir Lach, Leroy Cronin,
• Abstract summary: We exploit the concept of Turing completeness applied to robotic platforms for chemistry. We leverage the concept of computability by computers to synthesizability of chemical compounds by automated synthesis machines.
• Score: 0.0
• License:
• 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 is demanding because it is hard to ensure that the process can be understood at a high level of abstraction, and then reduced to practice. Herein we exploit the concept of Turing completeness applied to robotic platforms for chemistry that can be used to synthesise complex molecules through unit operations that execute chemical processes 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 colour gamut and conditional logic are presented and examples of chemical use-cases are discussed. Over 16.7 million combinations of Red, Green, Blue (RGB) colour space were binned into 5 discrete values and measured over 10 regions of interest (ROIs), affording 78 million possible states per step and served 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 automated and autonomous pursuit of increasingly complex molecules.

Related papers

• On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning [87.73401758641089]
  Chain-of-thought (CoT) reasoning has improved the performance of modern language models (LMs) We show that LMs can represent the same family of distributions over strings as probabilistic Turing machines.
  arXiv  Detail & Related papers  (2024-06-20T10:59:02Z)
• Autonomous Quantum Processing Unit: What does it take to construct a self-contained model for quantum computation? [0.27309692684728604]
  A formalism for quantum Turing machines lifts this input-output feature into the quantum domain. We develop a framework that we dub the autonomous Quantum Processing Unit (aQPU) Using the theory of open quantum systems we are able to use the aQPU as a formalism to investigate relationships between the thermodynamics, complexity, speed and fidelity of a desired quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T19:00:02Z)
• Chemist-X: Large Language Model-empowered Agent for Reaction Condition Recommendation in Chemical Synthesis [57.70772230913099]
  Chemist-X automates the reaction condition recommendation (RCR) task in chemical synthesis with retrieval-augmented generation (RAG) technology. Chemist-X interrogates online molecular databases and distills critical data from the latest literature database. Chemist-X considerably reduces chemists' workload and allows them to focus on more fundamental and creative problems.
  arXiv  Detail & Related papers  (2023-11-16T01:21:33Z)
• On the Representational Capacity of Recurrent Neural Language Models [56.19166912044362]
  We show that a rationally weighted RLM with computation time can simulate any deterministic probabilistic Turing machine (PTM) with rationally weighted transitions. We also provide a lower bound by showing that under the restriction to real-time computation, such models can simulate deterministic real-time rational PTMs.
  arXiv  Detail & Related papers  (2023-10-19T17:39:47Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability [0.0]
  We show that computing the time, space, or error accumulated by the global simulator are simulation properties and therefore are undecidable. These simulation properties give rise to special relativistic effects in the relative model which we use to construct a Church-Turing-Deutsch thesis.
  arXiv  Detail & Related papers  (2022-06-13T18:58:41Z)
• Detailed Balanced Chemical Reaction Networks as Generalized Boltzmann Machines [0.0]
  We show how a biochemical computer can use intrinsic chemical noise to perform complex computations. We also use our explicit physical model to derive thermodynamic costs of inference.
  arXiv  Detail & Related papers  (2022-05-12T18:59:43Z)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• Computational Hierarchy of Elementary Cellular Automata [0.0]
  We study the ability of cellular automata to emulate one another. We show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially. We believe our work can help design parallel computational systems that are Turing-complete and also computationally efficient.
  arXiv  Detail & Related papers  (2021-08-01T10:00:54Z)
• Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers [50.85524803885483]
  This work proposes a formal definition of statistically meaningful (SM) approximation which requires the approximating network to exhibit good statistical learnability. We study SM approximation for two function classes: circuits and Turing machines.
  arXiv  Detail & Related papers  (2021-07-28T04:28:55Z)
• A Quantum Finite Automata Approach to Modeling the Chemical Reactions [0.0]
  The study of chemical information processing with quantum computational models is a natural goal. We have modeled chemical reactions using two-way quantum finite automata, which are halted in linear time. It has been proven that computational versatility can be increased by combining chemical accept/reject signatures and quantum automata models.
  arXiv  Detail & Related papers  (2020-07-08T09:15:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.