The following table shows some of the classes of problems (or languages, or grammars) that are considered in computability theory (blue) and complexity theory (green).

• 下面的表格指出了在可计算性（蓝色）和复杂性理论（绿色）应当考虑的一些种类的问题。