Algorithmic Randomness and Complexity
Algorithmic Randomness and Complexity
复制标题
DOI：
10.1007/978-0-387-68441-3
复制
发表时间：
2010-01-01
期刊：
影响因子：
--
通讯作者：
Hirschfeldt, Denis R.
中科院分区：
文献类型：
--
作者：
Downey, Rodney G.;Hirschfeldt, Denis R.
这本书关注的是真实的数字的可计算性和复杂性的理论。这一理论是由图灵，Grzegorczyk，拉科姆贝，巴拿赫和马祖尔，并已看到近年来迅速增长。可计算性和复杂性理论是理论计算机科学的两个核心研究领域。直到最近，这些领域的大部分工作都集中在离散结构的问题上，但在真实的数和其他连续结构上，可计算性理论和复杂性理论已经有了巨大的发展，特别是结合了”随机性“的概念。“这种增长的一个原因是，越来越多的计算问题的真实的数字正在处理的计算机科学家-在计算几何和建模的动态和混合系统。研究这些问题的科学家来自不同的领域，如理论计算机科学、域理论、逻辑、构造数学、计算机算术、数值数学和分析。理论计算机科学、逻辑、可计算性理论和复杂性的所有研究人员的基本资源。
This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur and has seen rapid growth in recent years. Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discrete structures, but there has been enormous growth of computability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of" randomness." One reason for this growth is that more and more computation problems over the real numbers are being dealt with by computer scientists--in computational geometry and in the modeling of dynamical and hybrid systems. Scientists working on these questions come from such diverse fields as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, and analysis. An essential resource for all researchers in theoretical computer science, logic, computability theory and complexity.