Chemical implementation of finite-state machines - PubMed (original) (raw)

Chemical implementation of finite-state machines

A Hjelmfelt et al. Proc Natl Acad Sci U S A. 1992.

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 problem

PubMed Disclaimer

Similar articles

Cited by

References

    1. Biosystems. 1987;21(1):1-11 - PubMed
    1. Phys Rev Lett. 1990 May 14;64(20):2354-2357 - PubMed
    1. J Theor Biol. 1983 Oct 21;104(4):591-8 - PubMed
    1. Phys Rev Lett. 1985 Feb 25;54(8):735-738 - PubMed
    1. Proc Natl Acad Sci U S A. 1991 Dec 15;88(24):10983-7 - PubMed

LinkOut - more resources