The following table shows some of the classes of problems (or languages, or grammars) that are considered in computability théory (blue) and complexity théory (green). If class X is a strict subset of Y, then X is shown below Y, with a dark line connecting them. If X is a subset, but it is unknown whether they are equal sets, then the line is lighter and is dotted.