This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
$\overline{K}\;\leq\;\{ p \mid \forall y:\;M_p(y){\uparrow} \}$
Reduce $\overline{K}$ to the set of natural numbers such that the program
codified by them does not halt with any input (roughly, the set of programs
non-halting with any input), in order to prove that such set is not
semi-decidable (not recursively enumerable).
Authors: Carles Creus, Guillem Godoy
/
Documentation: