Theory of Computation by Kyle Burke
Overview & Synopsis
This pdf begins with an overview of resources, organization and motivation and preview of CS theory covering the Limits of Computation, the Undecidability of the Halting Problem.The Automata and Machines including Deterministic and Nondeterministic Finitestate Automata, Pushdown Automata, and Turing Machines and Language Classes. Finally focus shifts to Computational Complexity, discussing NPCompleteness, Approximation Algorithms, and the Hardness of Approximation.
Indexed from repository: FreeBookCentre
(
freebookcentre.net)
Document Information
| Document Title | Theory of Computation by Kyle Burke |
|---|---|
| Author / Organization | Kyle Burke |
| Categories | Computation Theory |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
FreeBookCentre
(freebookcentre.net)
|
| File Format | application/pdf (Portable Document Format) |
| Page Count | 114 pages |
| Language | EN |
| Catalog ID | DOC-309167 |
| Original Source Link | Visit Source Page on freebookcentre.net » |