1.Turing Patterns in the Lattice Boltzmann Medium
格子Boltzmann介质中的Turing斑图
2.Bacteria-phage computer takes insertion/deletion systems as its theoretical model, this model has the same computing capability as Turing machines.
菌毒计算机采用insertion/deletion systems(插入删除系统)为其理论模型，该系统具有和Turing机等同的计算能力。
3.Summarily, the introduced work lays a foundation for further studies on more complicated quantum automata and quantum grammars such as quantum pushdown automata and Turing machine as well as quantum context-free grammars and context-sensitive grammars.
因此,为进一步研究更复杂的量子自动机(如量子下推自动机和Turing机)和量子文法(如量子上下文无关文法和上下文有关文法)奠定了基础.
4.Theorem 3 In the theory of Boolean algebra without atomic elements to decide a sentence with length n the Turing time and space spent in the procedure is in the exponential degree of 2 2 cn .
定理 3 无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 .
5.A model proposed by Davis for computable functions is equivalent to Turing machine and consists of three basic Fortran-form instructions.
Davis曾提出由三条Fortran语言形的基本指令组成的与Turing机等价的计算模型。
6.SIMULATION OF TURING MACHINE BY PETRI NET
用Petri网模拟Turing机
7.This paper discusses how to simulate Turing machine by Petri net from the viewpointof information transformation.
本文从信息变换的角度来阐明“如何用Petri网模拟Turing机”。
8.A Note on the Recursively Controlled Turing Reducibility
关于递归控制Turing可化归性
9.An alternating Turing machine M is a generalization of a nondeterministic Turing machine, whose state set is partitioned into‘universal’and‘existential’states.
交替式(alternating)图灵机是非确定性图灵机的推广,它的状态集合被分为万能状态(universal state)和存在状态(existential state)。
10.In this paper, we made a improvement on the three solving methods of Turing Machine problem, which optimized the design of Turing Machine with reduced redundant state and simplified function _δ_.
给出了三种优化的解题方法,与常规方法相比用较少的状态数优化了图灵机的设计,达到减少状态的冗余和简化δ映像函数的目的.
