User:Karoshbn/Books/MATHEMATICS IX - Theory of computation
 | 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 ] | ||||||||
MATHEMATICS IX
Theory of computation
- Theory of computation
- Automata theory
- Recursively enumerable language
- Turing machine
- Context-sensitive grammar
- Linear bounded automaton
- Context-free grammar
- Pushdown automaton
- Regular grammar
- Finite-state machine
- Formal language
- Computability theory
- Rice's theorem
- Halting problem
- Computational complexity theory
- Algorithm
- Big O notation
- Asymptotic analysis
- NP (complexity)
- P versus NP problem
- Model of computation
- Church–Turing thesis
- Lambda calculus
- Combinatory logic
- Μ-recursive function
- Function composition (computer science)
- Primitive recursive function
- Markov algorithm
- Semi-Thue system
- Register machine
- Gödel numbering
- Regular expression
- Programming language
- Chomsky hierarchy