Computable Analysis - An Introduction (Hardcover, 2000 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Texts in Theoretical Computer Science. An EATCS Series
Release date:	September 2000
First published:	2000
Authors:	Klaus Weihrauch
Dimensions:	235 x 155 x 26mm (L x W x T)
Format:	Hardcover
Pages:	288
Edition:	2000 ed.
ISBN-13:	978-3-540-66817-6
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Vector & tensor analysis
LSN:	3-540-66817-9
Barcode:	9783540668176

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!