# Computability and Complexity Theory (Texts in Computer Science) by Steven Homer, Alan L. Selman pdf epub fb2

**Author:**Steven Homer, Alan L. Selman

**Title:**Computability and Complexity Theory (Texts in Computer Science)

**ISBN:**0387950559

**ISBN13:**978-0387950556

**Other Formats:**doc mobi txt lit

**Pages:**207 pages

**Publisher:**Springer; 1 edition (June 21, 2001)

**Language:**English

**Category:**Computers & Technology

**Size PDF version:**1313 kb

**Size EPUB version:**1378 kb

**Subcategory:**Computer Science

### FREE Download links

**1313 downloads at 24 mb/s**

PDF version

**1378 downloads at 22 mb/s**

FB2 version

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.