Mathematical Sciences Classification System
68Qxx - Theory of computing
-
68Q01General
-
68Q05
-
68Q10Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) [See also 68Q85]
-
68Q12
-
68Q15
-
68Q17Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) [See also 68Q15]
-
68Q19Descriptive complexity and finite models [See also 03C13]
-
68Q25Analysis of algorithms and problem complexity [See also 68W40]
-
68Q30Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32]
-
68Q32Computational learning theory [See also 68T05]
-
68Q42Grammars and rewriting systems
-
68Q45
-
68Q55
-
68Q60Specification and verification (program logics, model checking, etc.) [See also 03B70]
-
68Q65Abstract data types; algebraic specification [See also 18C50]
-
68Q70
-
68Q80Cellular automata [See also 37B15]
-
68Q85Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
-
68Q87
-
68Q99None of the above, but in this section