首页 | 本学科首页   官方微博 | 高级检索  
     


On randomness, determinism and computability
Authors:Edward J. Wegman
Affiliation:

Center for Computational Statistics and Probability, George Mason University, Fairfax, VA 22030, U.S.A.

Abstract:
This paper discusses the meaning and relationship of randomness and determinism. A fundamental development of chaotic dynamical systems is given with examples. Such systems are seen to exhibit randomness in the usual sense of unpredictability. The formal definition of randomness in terms of algorithmic incompressibility is also discussed. The role of recursion in computability and randomness is also discussed.
Keywords:Random   chaos   chaotic dynamics   computability   recursive functions   unsolvability   degrees of randomness   random number generators   subjective probability   random experiment   analysis of residuals   chaotic dynamical systems   Turing machine
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号