Poetry Madness
 
 

Recently Viewed clear list


Original Essays | April 11, 2014

Paul Laudiero: IMG Shit Rough Draft



I was sitting in a British and Irish romantic drama class my last semester in college when the idea for Shit Rough Drafts hit me. I was working... Continue »
  1. $9.07 Sale Trade Paper add to wish list

spacer

Computable Analysis (Texts in Theoretical Computer Science)

by

Computable Analysis (Texts in Theoretical Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

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.

Synopsis:

This is a broad systematic introduction to computable analysis. Merging fundamental concepts of analysis and recursion theory into a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material.

Synopsis:

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.

Product Details

ISBN:
9783540668176
Author:
Weihrauch, Klaus
Author:
Weihrauch, K.
Publisher:
Springer
Location:
Berlin, Heidelberg
Subject:
Mathematical Analysis
Subject:
Word Processing - General
Subject:
Word processing
Subject:
Computer Mathematics
Subject:
Discrete Mathematics
Subject:
Computable functions
Subject:
Recursion theory
Subject:
Computer Science
Subject:
complexity in analysis
Subject:
computability in analysis
Subject:
computable analysis
Subject:
computable real functions
Subject:
Computation by Abstract Devices
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Analysis
Subject:
Mathematical Logic and Formal Languages
Subject:
Mathematics of Computing
Subject:
Mathematical Logic and Foundations
Subject:
Mathematics-Analysis General
Subject:
Machine Theory
Subject:
B
Subject:
Computer software
Subject:
Global analysis (Mathematics)
Subject:
Logic, symbolic and mathematical
Copyright:
Edition Description:
Book
Series:
Texts in Theoretical Computer Science. An EATCS Series
Series Volume:
[66]
Publication Date:
20001127
Binding:
HARDCOVER
Language:
English
Illustrations:
Yes
Pages:
295
Dimensions:
235 x 155 mm 580 gr

Other books you might like

  1. Basic Category Theory for Computer... New Trade Paper $36.25
  2. Progress in Computer Science and... New Hardcover $150.50
  3. Introduction to Circuit Complexity... New Hardcover $130.25
  4. International Series in Operations... New Hardcover $300.75
  5. Algorithms for Minimization Without...
    New Trade Paper $14.95

Related Subjects

Computers and Internet » Personal Computers » Desktop Applications » Word Processing
Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Analysis General

Computable Analysis (Texts in Theoretical Computer Science) New Hardcover
0 stars - 0 reviews
$118.50 Backorder
Product details 295 pages Springer-Verlag - English 9783540668176 Reviews:
"Synopsis" by , This is a broad systematic introduction to computable analysis. Merging fundamental concepts of analysis and recursion theory into a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material.
"Synopsis" by , 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.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.