期刊文献+

虚拟的孪生图灵机——以双语信息处理为例

Virtual Twin Turing Machine:Bilingual Information Processing as an Example
下载PDF
导出
摘要 本文阐述一种虚拟的孪生图灵机,即:由两个图灵机组成的孪生并行计算机,其特征是其受限模式与派生模式分别由汉语的言即单音节字的基本符号对象和语即双音节多音节字组的符号组合解释为例加以说明。其作用在于基于它可建构理想的双语信息处理系统,即:协同智能计算系统;应用它可形成并行计算、分布计算、网格计算、虚拟计算和云计算乃至超级计算。其意义在于借助它蕴含的协同智能计算本质——虚拟与现实的关系,可把图灵可计算性、计算复杂性(其中揭示了一个基本原理——NP=P当且仅当N可有可无)和图灵测试连贯起来。 In this paper the authors describe a virtual twin Turing machines, namely: the twin parallel computer consisting of two parallel Turing machine, which is characterized by its limited and derived mode that can be illustrated as an example by that the basic symbols object is the category Zi namely single syllable Yan and by that the symbols combination explained is ZiZu namely syllables Yu both in Chinese. Its role is that based on it the bilingual information processing systems can be constructed perfectly, namely: the co- intelligent computing systems; its applications include the parallel computing, distributed computing, grid computing, virtual computing and cloud computing as the super-computing. Its significance is that the Turing computability, computational complexity (of these, it may reveal the basic principles - NP = P if and only ifN is dispensable) and the Turing Test can be explained by using the nature of coUaborative intelligence and the relationship between virtual and reality.
出处 《软件》 2011年第8期1-5,17,共6页 Software
基金 中美合作项目:塞尔研究双语信息处理课题(20110128)
关键词 图灵机 人机交互 双语信息处理 Turing machine Human-Computer Interaction Bilingual Information Processing
  • 相关文献

参考文献11

  • 1A.M.Turing.On Computable Numbers,with an application to the Entscheidungsproblem[C] ,Proceedings of the London Mathematical Society.Second Series,42,230-265,1936.
  • 2J.Hartmanis.On the Computational Complexity of Algorithms.Trans.Am.Math.Soc.Vol.117,1965.
  • 3JI X G,DENG Y Y,WANG P.Characters of atmosphere pressure,pure oxygen fixed bed gasification of seven kinds coal[J].Clean Coal Technology,2004,25(4):50-52.JI X G,DENG Y Y,WANG P.Characters of atmosphere pressure,pure oxygen fixed bed gasification of seven kinds coal[J].Clean Coal Technology,2004,25(4):50-52.
  • 4Marvin L.Minsky.Computation:finite and infinite machines[M].Prentice-Hall,Inc.,1967.
  • 5Stephen A.Cook,The Complexity of Theorem Proving Procedures[C].Proceedings Third Annual ACM Symposium on Thoery of Computing,pp 151-158.1971.
  • 6Richard M.Karp.Reducibility Among Combinatorial Problems[J].The Journal of Symbolic Logic,Vol.40,No.4,pp.618-619.1975.
  • 7Wikipedia.[EB/OL].[on 12 July 2011].http://en.wikipedia.org/wiki/Computational_complexity_theory.
  • 8A.M.Turing.Computing Machinery and Intelligence[J].Mind 49:433-460,1950.
  • 9David M.Kroenke,David Auer.Database Processing (11th Edition).Prentice Hall Press.August 7,2009.
  • 10Michael Armbrust,Armando Fox,Rean Grith,Anthony D.Joseph,Randy H.Katz,Andrew Konwinski,Gunho Lee,David A.Patterson,Ariel Rabkin,Ion Stoica,and Matei Zaharia.Above the clouds:A berkeley view of cloud computing.Technical Report UCB / EECS-2009-28,EECS Department,University of California,Berkeley,Feb 2009.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部