Details

Title A Recursive Introduction to the Theory of Computation (Texts in Computer Science)
Author Smith, Carl
Binding Hardback
Edition number 1994th
Edition 1994
Condition Used - Good
Pages 148
Volumes 1
Language ENG
Publisher Springer
Publication date 1994-10-14
Illustrated Yes
Features Bibliography, Illustrated, Index
Bookseller's Inventory # 0387943323.G
ISBN 9780387943329 / 0387943323
Weight 0.85 lbs (0.39 kg)
Dimensions 9.56 x 6.29 x 0.66 in (24.28 x 15.98 x 1.68 cm)
Category Mathematics
Library of Congress subjects Computer programming, Recursive functions - Data processing
Library of Congress Catalogue Number 94021785
Dewey Decimal Code 511.35
Quantity available 1

About Bonita California, United States

Biblio member since 2020

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 Bonita

Reader reviews for A Recursive Introduction to the Theory of Computation (Texts in Computer Science)

Write a review for this book

Important Terms and Guidelines

Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
Reviews must be at least 140 characters in length.
Please do not reveal critical plot elements.
This is not a help line. Contact customer support if you need help.

Your review must not include:

Obscenities, discriminatory language, or other insulting language not suitable for public domain
Advertisements, “spam” content, or references to other products, offers or websites.
Email addresses, URLs, phone numbers, physical addresses or other contact information.
Overly critical comments about other reviews or reviewers
Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
Availability, price, or alternative ordering/shipping information

From the publisher

The 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 notion 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 not. 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.

From the rear cover

The 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 notion 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 not.

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