Computer Science and Scientific Computing – serie

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.

In this book the authors try to bridge the gap between the treatments of matrix theory and linear algebra. It is aimed at graduate and advanced undergraduate students seeking a foundation in mathematics, computer science, or engineering. It will also be useful as a reference book for those working on matrices and linear algebra for use in their scientific work.