This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
$\overline{K}\;\leq\;\{ \langle p,q\rangle \mid \mathtt{Dom}(\varphi_p)\subset\mathtt{Dom}(\varphi_q) \}$
Reduce $\overline{K}$ to the set of pairs of natural numbers codifying programs
such that the domain of the function computed by the machine codified by the
first one is strictly included into the domain of the function computed by the
machine codified by the second one (roughly, the set of pairs of programs such
that the domain of the function computed by the first one is strictly included
into the domain of the function computed by the second one), in order to prove
that such set is not semi-decidable (not recursively enumerable).
Authors: Carles Creus, Guillem Godoy
/
Documentation: