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

Libro 6 de 45: Texts in Theoretical Computer Science. An EATCS

Weihrauch, K.; Weihrauch, Klaus

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

Sinopsis

Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament 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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament 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.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2000
Idioma
Inglés
ISBN 10 
3540668179
ISBN 13 
9783540668176
Encuadernación
Tapa dura
Número de páginas
304
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  3642631029 ISBN 13:  9783642631023
Editorial: Springer, 2013
Tapa blanda