Skip to content
Book cover of Automata, Computability and Complexity

Automata, Computability and Complexity

20071120 pagesPrentice Hall

Synopsis

This comprehensive textbook explores the foundational concepts of automata theory, computability, and computational complexity. It provides a rigorous treatment of the mathematical models of computation, the limits of what can be computed, and the resources required to solve computational problems. Ideal for students and researchers in computer science, this book offers a deep dive into the theoretical underpinnings of computing.

Vibe

About the author

Elaine A. Rich is a writer who explores the world of artificial intelligence. Her work offers clear insights into this fascinating field.

Genres

Subjects

Edition

Book cover of Automata, Computability and Complexity