It seems that you're in Germany. We have a dedicated site for Germany. Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable?
|Published (Last):||15 April 2019|
|PDF File Size:||7.42 Mb|
|ePub File Size:||5.63 Mb|
|Price:||Free* [*Free Regsitration Required]|
It seems that you're in Germany. We have a dedicated site for Germany. 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. 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.
Texts in Theoretical Computer Science. Buy eBook. Buy Hardcover. Buy Softcover. FAQ Policy. About this Textbook Is the exponential function computable? Show all. Naming Systems Pages Weihrauch, Prof. Computational Complexity Pages Weihrauch, Prof. Some Extensions Pages Weihrauch, Prof. Show next xx. Recommended for you. PAGE 1.
Donate to arXiv
Computable Analysis : An Introduction