计算机科学 ›› 2011, Vol. 38 ›› Issue (7): 302-305.
• 体系结构 • 上一篇
张海粟，张松林，陈桂生
出版日期:
发布日期:
基金资助:
ZHANG Hai-su,ZHANG Song-lin,CHEN Gui-sheng
Online:
Published:
摘要： 涌现描述了特定系统在超过某阂值时突然出现的现象，中间没有明显的过渡过程。提出了图灵机计算模型在时空复杂度上所表现出的计算涌现现象，引入了受限生成过程(Constrained Venerating Procedure, CGP)模型来描述图灵机的计算过程，通过CGP模型刻画了机制参与次数、参与深度和平均参与度等3个涌现数字特征，提出了计算涌现的CGP分析方法并在3类典型图灵机计算过程中进行了验证分析。
关键词: 计算涌现，受限生成过程，图灵机，复杂性分析
Abstract: The complexity of computational models can also put up some emergence properties around several certain critical values. I}his paper surveyed some computational emergence behaviors, and built their Constrained Generating Procedure(CGP) model. We introduced the CGP mechanic participating times, participating depth and average participaling degree, and then analyzed the critical values of emergence properties on 3 typical Turing machine computation processes.
Key words: Computational emergence, Constrained generating procedure, Turing machine, Computing complexity
张海粟，张松林，陈桂生. 基于受限生成过程模型的计算涌现分析[J]. 计算机科学, 2011, 38(7): 302-305. https://doi.org/
ZHANG Hai-su,ZHANG Song-lin,CHEN Gui-sheng. Computational Emergence and its Constrained Generating Procedure Model[J]. Computer Science, 2011, 38(7): 302-305. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I7/302
Cited
首页