Posts in Computability

Set k is recursively enumerable non-recursive - The proof.

Characterization Theorem in Computability - What it states and a proof.

Futamura's Projections - What they are and what they actually mean.

Halting Problem - The foundation of the computability theory, that gave it the first headaches - until Turing got a brilliant idea.

Turing-complete Languages - What they are and their characteristics.

Kleene's Recursion Theorems in Computability - What they are and their proof.

Posts's Theorem in Computability - What it states and a proof.

Rice's Theorem in Computability - What it states and a proof.

Cantor's Theorem in Computability - What it states and a proof.