.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
Klaus Weihrauch
€ 68.44
FREE Delivery in Ireland
Description for Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
Hardcover. Merging fundamental concepts of analysis and recursion theory to a new theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is written for graduate-level and senior students in computer science or mathematics. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 288 pages, 44 black & white illustrations, 1 colour illustrations, biography. BIC Classification: PBK; UMB; UYA. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 18. Weight in Grams: 680.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
Springer
Condition
New
Series
Texts in Theoretical Computer Science: An EATCS Series
Number of Pages
288
Place of Publication
Berlin, Germany
ISBN
9783540668176
SKU
V9783540668176
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)