Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series) - Hardcover

Book 6 of 44: Texts in Theoretical Computer Science. An EATCS

Weihrauch, Klaus

 
9783540668176: Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
Hardcover
ISBN 10: 3540668179 ISBN 13: 9783540668176
Publisher: Springer, 2000

Synopsis

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.

"synopsis" may belong to another edition of this title.

Synopsis

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.

"About this title" may belong to another edition of this title.

Publisher
Springer
Publication date
2000
Language
English
ISBN 10 
3540668179
ISBN 13 
9783540668176
Binding
Hardcover
Number of pages
298

Other Popular Editions of the Same Title

9783642631023: Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Featured Edition

ISBN 10:  3642631029 ISBN 13:  9783642631023
Publisher: Springer, 2013
Softcover