Exercise 9:

K    {pDom(φp)2}K\;\leq\;\{ p \mid |\mathtt{Dom}(\varphi_p)|\geq 2 \}
Reduce KK to the set of natural numbers codifying programs such that the domain of the function computed by the program has cardinal at least 22 (roughly, the set of programs implementing functions whose domain has at least two elements) in order to prove that such set is undecidable (not recursive).
Authors: Carles Creus, Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.