Abstract Recursion and Intrinsic Complexity(Lecture Notes in Logic)

抽象递归与内在复杂性

数理逻辑与数学基础

售   价:
1054.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2018年06月12日
装      帧
精装
ISBN
9781108415583
复制
页      码
283
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader’s understanding, to current open problems.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个