User:Pseudohuman92/Books/Theory of Computation
Appearance
The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] |
- Introduction
- Computer science
- Theoretical computer science
- Theory of computation
- Automata Theory
- Automata theory
- Finite-state machine
- Deterministic pushdown automaton
- Pushdown automaton
- Linear bounded automaton
- Turing machine
- Universal Turing machine
- Non-deterministic Turing machine
- Alternating Turing machine
- Read-only Turing machine
- Read-only right moving Turing machines
- Multi-track Turing machine
- Probabilistic Turing machine
- Quantum Turing machine
- Turing machine equivalents
- Turing machine examples
- Büchi automaton
- Ω-automaton
- Muller automaton
- Computability Theory
- Computability theory
- Computable function
- Turing degree
- Computational Complexity Theory
- Computational complexity theory
- Context of computational complexity
- Structural complexity theory
- Descriptive complexity theory
- Quantum complexity theory
- Parameterized complexity
- Game complexity
- Proof complexity
- Transcomputational problem
- Appendix
- List of complexity classes
- List of unsolved problems in computer science
- List of computability and complexity topics
- List of important publications in theoretical computer science