Artículo: AMZ-B00BF9FK28

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

Format:

eTextbook

Hardcover

Paperback

eTextbook

Detalles del producto
Disponibilidad
Sin stock
Peso con empaque
0.20 kg
Devolución
No
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • 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.

Producto prohibido

Este producto no está disponible

Este producto viaja de USA a tus manos en

Conoce más detalles

Highlight, take notes, and search in the book