Knihobot

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

Hodnocení knihy

Více o knize

This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.

Nákup knihy

Computability, Complexity, and Languages, Martin Davis, Ron Sigal, Elaine J Weyuker

Jazyk
Rok vydání
1994
Jakmile se objeví, pošleme e-mail.

Doručení

Platební metody

4,0
Velmi dobrá
25 Hodnocení

Tady nám chybí tvá recenze.

Titul
Computability, Complexity, and Languages
Podtitul
Fundamentals of Theoretical Computer Science
Jazyk
anglicky
Rok vydání
1994
ISBN10
0122063821
ISBN13
9780122063824
Série
Hodnocení
3,95 z 5
Anotace
This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.