Volume 28 Issue 5
May  2002
Turn off MathJax
Article Contents
LI Wei, MA Shi-long, SUI Yue-fei, et al. Convergent Infinite Computation and Applications[J]. Journal of Beijing University of Aeronautics and Astronautics, 2002, 28(5): 481-489. (in Chinese)
Citation: LI Wei, MA Shi-long, SUI Yue-fei, et al. Convergent Infinite Computation and Applications[J]. Journal of Beijing University of Aeronautics and Astronautics, 2002, 28(5): 481-489. (in Chinese)

Convergent Infinite Computation and Applications

  • Received Date: 12 Jun 2002
  • Publish Date: 31 May 2002
  • Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations and establish a logical framework for describing and analyzing how an infinite computation interacts and evolves in changing environments and what the limit of the evolution might be. A logic for convergent infinite computations was proposed by extending first order theories using Cauchy sequences,which has stronger expression power than the first order logic. A computation model,called procedure scheme,for convergent infinite computations was proposed,on the basis of classical Turing machine and formal theory sequences and their limits. It has stronger computing power than Turing machines and real machines in the sense of limit computations. As an example of application of the above study,the limit behavior of data mining was discussed by means of limits of theory sequences.

     

  • loading
  • [1] Abiteboul S,Vardi M Y, Vianu V. Computing with infinitary logic[J]. Theoretical Computer Science,1995,149(1):101~128. [2]Vardi M Y,Wolper P.Reasoning about infinite computations[J]. Information and Computation,1994,115(1):1~37. [3]李 未.一个开放的逻辑系统[J].中国科学(A辑),1992,10:1103~1113. [4]Blum L,Shub M,Smale S. On a theory of computation and complexity over the real numbers:NP-completeness,recursive function and universal machines,bull(New Series)[J]. Amer Math Soc,1989,21(1):1~46. [5]Chadzelek T,Hotz G.Analytic machines[J].Theoretical Computer Science,1999,219:151~167. [6]Nienhuys-Cheng S H. Distance between herbrand interpretations:a measurefor approximations to a target concept. In:Proceedings of the 7th International Workshop on Inductive Programming, 1997.LNAI1297. [7]Li W. A logical framework for inductive inference and its rationality. In:Fu N, ed.Advanced Topics in Artificial Intelligence, 1999.LNAI1747. [8]Dahr M. Deductive databases:theory and applications[M].USA:International Thomson Computer Press,1997. [9]Li W,Ma S,Sui Y,et al. A logical framework for convergent infinite computations. http://xxx.lanl.gov/abs/cs.lo/0105020. [10] Li W,Ma S. A framework for analytic-intelligent agents. In:Proceedings of the International Conference on Artificial Intelligence. Las Vegas:CSREA Press,2000.691~697.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2264) PDF downloads(1130) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return