Algorithms, Complexity and Language Theory

Fields concerned with the mathematical study of procedures, their costs and the languages used to express them. It covers the design and analysis of algorithms, the classification of problems by the resources needed to solve them, and the formal semantics, type systems and foundations of programming languages. A field belongs here when it proves properties of programs or problems. It excludes the engineering of software, which belongs to Software And Its Engineering, and the models of computation placed in their own group.