All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $9.86Trending at AU $16.82
- AU $11.51Trending at AU $18.80
- AU $64.07Trending at AU $74.86
- AU $28.70Trending at AU $36.95
- AU $44.96Trending at AU $47.10
- AU $24.97Trending at AU $28.23
- AU $9.83Trending at AU $13.31
About this product
- DescriptionThe aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the tion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or t. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.
- Author(s)Carl Smith
- PublisherSpringer-Verlag New York Inc.
- Date of Publication14/10/1994
- SubjectComputing: General
- Series TitleTexts in Computer Science
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight910 g
- Width152 mm
- Height229 mm
- Spine12 mm
- Format DetailsLaminated cover
This item doesn't belong on this page.
Thanks, we'll look into this.