Computability theory

[658/76%]

Subtopics

Recursive function theory[318/72%]

Undecidability and reductions[126/79%]

Decidability[104/85%]

Oracle computation and relative computability[101/74%]

Turing machines[96/67%]

Recognizability and enumerability[91/74%]

Recursion theorem and self-reference[35/66%]

Programs with labels (goto/register programs) as a model of computation[30/100%]

Kolmogorov complexity[9/89%]

Busy beaver function[8/88%]

Arithmetical hierarchy and index set classification[6/17%]

Decidability of logical theories[4/100%]

Alternative models of computation[3/33%]

Computable (constructive) real numbers[2/100%]