Picture 1 of 1

Computability Theory: Concepts and Applications by Paul E. Dunne (Hardcover, 1991)

WeBuyBooks (2513666)

99.5% positive Feedback

Price:

£4.40

Free postage

Estimated delivery Wed, 18 Jun - Fri, 20 Jun

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

Good

Computability Theory: Concepts and Applications (Ellis Horwood Series in Computers and Their Applications), Dunne, Paul E., Good Condition Book. Title: Computability Theory: Concepts and Applications (Ellis Horwood Series in Computers and Their Applications).

About this product

Product Information

Computability theory is the branch of computer science concerned with identifying which computational problems cannot be solved by computer programs. Paul Dunne provides a basic introduction to the subject of computability that is primarily aimed at students of computer science. The text motivates the concept of models of computation as abstract representations of computer behaviour and illustrates how proofs of non-computability may be constructed with respect to these. The final chapters develop a much simplified proof of Godel's work on provability. The primary concern of the text is to motivate the important concerns of computability theory as a discipline within computer science rather than as an abstract mathematical subject. In contrast with many existing texts, the book is written in an easy-to-read style, providing a welcomingly straightforward review of computability theory.