- theory-of-computation-wikipedia
- alonzo-church
- alphabet
- artificial-intelligence
- asymptotic-analysis
- big-omega-notation
- big-theta-notation
- combinatory-logic
- formal-language
- function-abstraction
- function-application
- functional-programming
- grammar
- heuristic
- mu-recursive-functions
- nondeterministic-turing-machine
- np-complete
- np-completeness
- polynomial-time
- recursion-theory
- register-machine
- regular-expression
- regular-grammar
- sat-problem
- space-complexity
- time-complexity
- undecidability
- pushdown-automaton
- algorithm
- finite-automaton
- mathematical-logic
- alan-turing
- automata-theory
- big-o-notation
- chomsky-hierarchy
- church-turing-thesis
- computability-theory
- computational-complexity-theory
- formal-language-theory
- halting-problem
- lambda-calculus
- model-of-computation
- p-vs-np-problem
- rices-theorem
- theory-of-computation
- turing-machine
- ↑↓ to navigate
- ↵ to open
- ⟶ to select
- ⌘ ⌥ ↵ to open in a panel
- esc to dismiss
⌘ '
keyboard shortcuts