| 書目名稱 | Computable Analysis |
| 副標題 | An Introduction |
| 編輯 | Klaus Weihrauch |
| 視頻video | http://file.papertrans.cn/233/232033/232033.mp4 |
| 概述 | First textbook of this kind: a broad systematic introduction to computable analysis connecting analysis with computability and complexity theory.With many examples and figures and numerous exercises.I |
| 叢書名稱 | Texts in Theoretical Computer Science. An EATCS Series |
| 圖書封面 |  |
| 描述 | Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text. |
| 出版日期 | Textbook 2000 |
| 關(guān)鍵詞 | analysis; complexity; complexity in analysis; computability; computability in analysis; computable analys |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-56999-9 |
| isbn_softcover | 978-3-642-63102-3 |
| isbn_ebook | 978-3-642-56999-9Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 2000 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 18:26
發(fā)表于 2025-3-21 16:20:28
