株式会社極東書店トップ ＞ 商品一覧 ＞ Abstract Recursion and Intrinsic Complexity.
商品詳細
Abstract Recursion and Intrinsic Complexity.
・ISBN 978-1-108-41558-3 hard GB£ 121.00
￥38,332.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-108-23423-8
| 著者・編者 | Moschovakis, Yiannis N., |
|---|---|
| シリーズ | Lecture Notes in Logic |
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 2018 |
| ページ数 | 252 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-9677＞ |
解説
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.