Introduction to the Theory of Computation

@article{Sipser1996IntroductionTT,
  title={Introduction to the Theory of Computation},
  author={Michael Sipser},
  journal={SIGACT News},
  year={1996},
  volume={27},
  pages={27-29}
}
  • M. Sipser
  • Published 1996
  • Computer Science
  • SIGACT News
From the Publisher: Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need… 
UNDECIDABILITY AND THE STRUCTURE OF THE TURING DEGREES
TLDR
The Turing machine is introduced, an abstract model of computation, in order to develop the concepts of undecidability and Turing reduction, and the technique of proof by reduction is demonstrated.
Interleaving isotactics - An equivalence notion on behaviour abstractions
Computability and Complexity of Unconventional Computing Devices
TLDR
It is discovered that all claims that certain UCOMP devices can perform hypercomputation, super-Turing computation or solve NP-complete problems in polynomial time rely on the provision of one or more unphysical resources.
Querying big data from a database perspective
TLDR
Since the complexity of domain makes traditionally tractable queries infeasible, the classification of queries on relational big data according to their structure and computational complexity is analyzed.
Introducing Non-Determinism to the Parallel C Compiler
TLDR
This project introduces the ability of the PC Compiler to translate a race condition into a non-deterministic solution and test the viability of using “shortcutting” functions.
On finite automata with quantum and classical states
TLDR
Two-way finite automata with quantum and classical states (2QCFA) are considered, which can be seen as a classical two-way deterministic finite automaton with a fixed number of quantum bits and can recognize some context-free languages and even some non-context- free languages.
The Computation of Finite-State Complexity by Tania K . Roblot
TLDR
This thesis proposes a new variant to Algorithmic Information Theory constructed around finite-state complexity, a computable counterpart to Kolmogorov complexity based on finite transducers rather than Turing machines, and presents a first attempt at applying the finite- state complexity in a practical setting.
Improving the search for refactoring opportunities on object-oriented and aspect-oriented software
TLDR
A chronology of key events and stories from the reporting and editing of the Pulitzer Prize-winning book, “Jurassic Park: The Making of a Novel” (2003).
Providing curricular assistance to a third world university computer science department
TLDR
A liaison between Montana State University (USA) and Don Bosco University (El Salvador) that resulted in the first author teaching three advanced computer science topics at Don BosCO University is described and the pedagogy related to teaching advanced topics to students of a different culture while being translated is described.
...
...

References

SHOWING 1-3 OF 3 REFERENCES
Self-reference 180 / Terminology for the recursion theorem 183 / Applications 184 / Exercises and Problems 185 / Part Three
  • Complexity Theory
PSPACE-COMPLETENESS The TQBF problem -Winning strategies for games -Generalized geography 4
  • THE CLASSES L AND NL 5. NL-COMPLETENESS Searching in graphs 6. NL EQUALS CONL
The Recursion Theorem 179
  • The Recursion Theorem 179