Name: Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (en Inglés)
SKU: 7578967
Price: 80.45 USD
Availability: InStock
Author: Martin Davis; Ron Sigal; Elaine J. Weyuker
ISBN: 9780122063824

portada Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (en Inglés)

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (en Inglés)

Formato

Libro Físico

Editorial

Morgan Kaufmann

Autor

Martin Davis; Ron Sigal; Elaine J. Weyuker

Año

1994

Idioma

Inglés

N° páginas

609

Encuadernación

Tapa Dura

ISBN

122063821

ISBN13

9780122063824

N° edición

Categorías

Ciencias de la computación

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (en Inglés)

Martin Davis; Ron Sigal; Elaine J. Weyuker (Autor) · Morgan Kaufmann · Tapa Dura

Libro Nuevo Importado

Envío: 22 a 30 días háb.

$ 146.27$ 80.45

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 100 unidades

$ 80.45

Llega entre el 15 Sep y el 29 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (en Inglés)"

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.