3
speech-recognition
|
0
primitive-recursion
× 6 |
0
automata
× 2 |
0
dependent-types
|
2
computability
× 8 |
0
lambda-calculus
× 5 |
0
pushdown-automata
× 2 |
0
reference-request
|
2
programming-languages
× 2 |
0
complexity-theory
× 3 |
0
church-numerals
× 2 |
0
regular-languages
|
2
space-analysis
|
0
formal-grammars
× 3 |
0
static-analysis
× 2 |
0
recursion
|
2
memory-management
|
0
decision-problem
× 3 |
0
turing-completeness
|
0
undecidability
|
2
performance
|
0
computation-models
× 2 |
0
finite-automata
|
|
1
threads
|
0
turing-machines
× 2 |
0
polynomial-time
|
|
1
multi-tasking
|
0
complexity-classes
× 2 |
0
type-checking
|