A Recursive Introduction to the Theory of Computation

By:

Carl Smith

Format:

Hardback

Series:

Texts in Computer Science

Show Hide Adult Content

$144.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $36.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 13-25 June using International Courier

Description

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.

Release date Australia

October 14th, 1994

Author

Carl Smith

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational

Illustrations

VIII, 148 p.

Pages

148

Series

Texts in Computer Science

Dimensions

152x229x12

ISBN-13

9780387943329

Product ID

2434489

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here