| 68Q01 |
- |
General |
| 68Q05 |
- |
Models of computation (Turing machines, etc.) |
| 68Q10 |
- |
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
| 68Q15 |
- |
Complexity classes (hierarchies, relations among complexity classes, etc.) |
| 68Q17 |
- |
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68Q19 |
- |
Descriptive complexity and finite models |
| 68Q25 |
- |
Analysis of algorithms and problem complexity |
| 68Q30 |
- |
Algorithmic information theory (Kolmogorov complexity, etc.) |
| 68Q32 |
- |
Computational learning theory |
| 68Q42 |
- |
Grammars and rewriting systems |
| 68Q45 |
- |
Formal languages and automata |
| 68Q55 |
- |
Semantics |
| 68Q60 |
- |
Specification and verification (program logics, model checking, etc.) |
| 68Q65 |
- |
Abstract data types; algebraic specification |
| 68Q70 |
- |
Algebraic theory of languages and automata |
| 68Q80 |
- |
Cellular automata |
| 68Q85 |
- |
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
| 68Q99 |
- |
Miscellaneous |
|
[
up
|
top
]
|
