Category:計算可能性理論

Computability theory

Halting problem

Post's theorem

Double recursion

Kőnig's lemma

Smn theorem

Friedberg numbering

Rice–Shapiro theorem

Kleene's recursion theorem

Elementary recursive function

Complete numbering

Low basis theorem

Computation in the limit

Effective Polish space

Creative and productive sets

Simple set

Computably inseparable

Numbering (computability theory)

Computable analysis

Analytical hierarchy

Computable set

Slow-growing hierarchy

Hardy hierarchy

Grzegorczyk hierarchy

Computable number

Fast-growing hierarchy

Ackermann function

Busy beaver