CHEMICAL IMPLEMENTATION OF FINITE-STATE MACHINES

被引：87

作者：

HJELMFELT, A ^{[1
]}

WEINBERGER, ED ^{[1
]}

ROSS, J ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT CHEM,STANFORD,CA 94305

来源：

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 1992年 / 89卷 / 01期

关键词：

D O I：

10.1073/pnas.89.1.383

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

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.

引用

页码：383 / 387

页数：5