14
turing-machines
× 10 |
4
turing-completeness
× 2 |
3
knapsack-problems
|
1
compilers
|
12
finite-automata
× 6 |
4
asymptotics
× 2 |
3
optimization
|
1
time-complexity
|
11
formal-languages
× 7 |
3
formal-grammars
× 2 |
2
transducers
|
1
check-my-answer
|
11
automata
× 6 |
3
decision-problem
× 2 |
2
mapreduce
|
1
first-order-logic
|
9
regular-languages
× 3 |
3
reductions
× 2 |
2
strings
|
1
pushdown-automata
|
8
computability
× 4 |
3
imperative-programming
|
2
buchi-automata
|
0
computation-models
|
6
context-free
× 5 |
3
algorithm-analysis
|
2
space-complexity
|
0
linear-programming
|
6
nondeterminism
× 3 |
3
algorithms
|
2
board-games
|
0
modelling
|
6
complexity-theory
× 3 |
3
planar-graphs
|
2
search-problem
|
0
rice-theorem
|
5
church-turing-thesis
× 2 |
3
graphs
|
2
search
|
0
semi-decidability
|
5
linear-bounded-automata
× 2 |
3
terminology
|
1
integer-programming
× 2 |
0
recursion
|
5
regular-expressions
× 2 |
3
halting-problem
|
1
network-flow
|
|
4
undecidability
× 3 |
3
complexity-classes
|
1
floating-point
|
ttnick
