Computable Analysis by Klaus Weihrauch
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.-
Information and Randomness
-
Universal Artificial Intelligence
-
Interactive Theorem Proving and Program Development
-
Graphs and Algorithms in Communication Networks
-
Models of Massive Parallelism
-
Structural Complexity I
-
The Resolution Calculus
-
Models of Computation
-
Dissemination of Information in Optical Networks:
-
A Practical Theory of Reactive Systems
-
Petri Net Synthesis
-
Grammatical Picture Generation
-
Temporal Logic and State Systems
-
Algorithmics for Hard Problems
-
Simulation Algorithms for Computational Systems Biology
-
Public-Key Cryptography
-
Communication Complexity and Parallel Computing
-
Boolean Functions and Computation Models
-
Verification of Reactive Systems
-
Theoretical Computer Science
-
Introduction to Circuit Complexity
-
Elements of Finite Model Theory
-
The Parametric Lambda Calculus
-
The Complexity Theory Companion
-
Introduction to Process Algebra
-
DNA Computing
-
Abstract Computing Machines
-
Design and Analysis of Randomized Algorithms
-
Dissemination of Information in Communication Networks
-
Formal Methods for Software Engineering
-
Complexity Theory and Cryptology
-
Parsing Schemata
| SKU | Unavailable |
| ISBN 13 | 9783642631023 |
| ISBN 10 | 3642631029 |
| Title | Computable Analysis |
| Author | Klaus Weihrauch |
| Series | Texts In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2013-11-20 |
| Number of pages | 288 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |