Books > Computers & Technology > Computer Science > Information Theory

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Product ID: 0122063821 Condition: USED (All books in used condition)

Payflex: Pay in 4 interest-free payments of R238.50. Read the FAQ

R 954

includes Duties & VAT

Delivery: 10-20 working days

Ships from USA warehouse.

Secure Transaction

VISA Mastercard payflex ozow

Product Description

Condition - Very Good

The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability, Complexity, and Languages is anÂ introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.

Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.
The number of exercises included has more than tripled.
Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.