BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

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

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

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An
Stock photo: cover may vary

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

by Weihrauch, Klaus/ Brauer, W. (Editor)/ Rozenberg, G. (Editor)/ Salomaa, A. (Editor)

Add to wish list
  • New
  • Hardback
New

Description

Springer Verlag, 2000. Hardcover. New. 1st edition. 285 pages. French language. 9.50x6.25x1.00 inches.
Ask the seller a question Add to wish list
A$132.03
A$29.26 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

  • Title Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
  • Author Weihrauch, Klaus/ Brauer, W. (Editor)/ Rozenberg, G. (Editor)/ Salomaa, A. (Editor)
  • Binding Hardback
  • Edition 1st
  • Condition New
  • Pages 288
  • Volumes 1
  • Language ENG
  • Publisher Springer Verlag
  • Publication date 2000
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # x-3540668179
  • ISBN 9783540668176 / 3540668179
  • Weight 1.33 lbs (0.60 kg)
  • Dimensions 9.21 x 6.14 x 0.69 in (23.39 x 15.60 x 1.75 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 00056310
  • Dewey Decimal Code 515
  • Quantity available 2

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

From the publisher

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.

First line

All over the world numerous computers are used for real number computation.
tracking-