Chemical implementation of finite-state machines.
- 1 January 1992
- journal article
- research article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 89 (1) , 383-387
- https://doi.org/10.1073/pnas.89.1.383
Abstract
With methods developed in a prior article on the chemical kinetic implementation of a McCulloch-Pitts neuron, connections among neurons, logic gates, and a clocking mechanism, we construct examples of clocked finite-state machines. These machines include a binary decoder, a binary adder, and a stack memory. An example of the operation of the binary adder is given, and the chemical concentrations corresponding to the state of each chemical neuron are followed in time. Using these methods, we can, in principle, construct a universal Turing machine, and these chemical networks inherit the halting problemKeywords
This publication has 5 references indexed in Scilit:
- Chemical implementation of neural networks and Turing machines.Proceedings of the National Academy of Sciences, 1991
- Unpredictability and undecidability in dynamical systemsPhysical Review Letters, 1990
- Switching mechanism of a cyclic enzyme system: role as a “chemical diode”Biosystems, 1987
- Undecidability and intractability in theoretical physicsPhysical Review Letters, 1985
- Dynamic behavior of cyclic enzyme systemsJournal of Theoretical Biology, 1983