Hjelmfelt A, Weinberger E D, Ross J
Max-Planck-Institut fur Biophysikalische Chemie, Gottingen, Federal Republic of Germany.
Proc Natl Acad Sci U S A. 1992 Jan 1;89(1):383-7. doi: 10.1073/pnas.89.1.383.
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
利用先前一篇关于麦卡洛克 - 皮茨神经元化学动力学实现、神经元之间的连接、逻辑门和时钟机制的文章中所开发的方法,我们构建了时钟有限状态机的示例。这些机器包括一个二进制解码器、一个二进制加法器和一个堆栈存储器。给出了二进制加法器操作的一个示例,并及时跟踪与每个化学神经元状态相对应的化学浓度。原则上,使用这些方法我们可以构建一台通用图灵机,并且这些化学网络继承了停机问题