Kolmogorov Complexity and Computational Complexity

数理逻辑与数学基础

原   价:
1105.00
售   价:
884.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2011年12月15日
装      帧
平装
ISBN
9783642777370
复制
页      码
105
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 100 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of complexity : Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compuational resources necessary to recognize or produce elements of the set. The relation between these two complexity measures has been considered for more than two decades, and may interesting and deep observations have been obtained. In March 1990, the Symposium on Theory and Application of Minimal­ Length Encoding was held at Stanford University as a part of the AAAI 1990 Spring Symposium Series. Some sessions of the symposium were dedicated to Kolmogorov complexity and its relations to the computational complexity the­ ory, and excellent expository talks were given there. Feeling that, due to the importance of the material, some way should be found to share these talks with researchers in the computer science community, I asked the speakers of those sessions to write survey papers based on their talks in the symposium. In response, five speakers from the sessions contributed the papers which appear in this book.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个