具有过滤连接的进化处理机的小型通用接受网络
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections
摘要：
在本文中，我们提出了一些结果，接受网络的进化处理器与过滤连接（ANEPFCs）的大小复杂性。我们表明，有普遍的ANEPFC大小为10，通过设计一种方法来模拟2-标签系统。该结果显著提高了通用ANEPFC的大小的已知上限，即18。我们还提出了一个新的，计算和计算效率高的模拟不确定性图灵机的ANEPFCs。更准确地说，我们描述（非正式地，由于空间的限制）如何ANEPFC与16个节点可以在O（f（n））时间模拟任何非确定性图灵机的时间复杂度f（n）。因此，模拟任意图灵机的网络中节点数目的已知上限从26减少到16。
英文摘要：
In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computationally and descriptionally efficient simulation of nondeterministic Turing machines by ANEPFCs. More precisely, we describe (informally, due to space limitations) how ANEPFCs with 16 nodes can simulate in O(f(n)) time any nondeterministic Turing machine of time complexity f(n). Thus the known upper bound for the number of nodes in a network simulating an arbitrary Turing machine is decreased from 26 to 16.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
