首页> 外文期刊>Computers and Artificial Intelligence >TEST TUBE DISTRIBUTED SYSTEMS BASED ON SPLICING
【24h】

TEST TUBE DISTRIBUTED SYSTEMS BASED ON SPLICING

机译:基于拼接的测试管分布式系统

获取原文
获取原文并翻译 | 示例
           

摘要

We define a symbol processing mechanism with the components (test tubes) working as splicing schemes in the sense of T. Head and communicating by redistributing the contents of tubes (in a similar way to the separate operation of Lipton-Adleman). (These systems are similar to the distributed generative mechanisms called Parallel Communicating Grammar Systems.) Systems with finite initial contents of tubes and finite sets of splicing rules associated to each component are computationally complete, they characterize the family of recursively enumerable languages. The existence of universal test tube distributed systems is obtained on this basis, hence the theoretical proof of the possibility to design universal programmable computers with the structure of such a system.
机译:我们定义了一个符号处理机制,其中的组件(试管)在T. Head的意义上充当拼接方案,并通过重新分配试管的内容进行通信(类似于Lipton-Adleman的单独操作)。 (这些系统类似于称为并行通信语法系统的分布式生成机制。)具有有限的管道初始内容和与每个组件关联的有限的拼接规则集的系统在计算上是完整的,它们表征了递归可枚举语言的族。在此基础上获得了通用试管分布式系统的存在,因此从理论上证明了使用这种系统结构设计通用可编程计算机的可能性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号