This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.

##
Exercise
1_{›}:

$K\;\leq\;\{ p \mid \exists y:\;M_p(y){\downarrow} \}$

Reduce $K$ to the set of natural numbers codifying programs such that the
program halts with some input (roughly, the set of programs that halt with some
input), in order to prove that such set is undecidable (not recursive).

Authors: Carles Creus, Guillem Godoy
/

Documentation: