Computability: Proving a predicate is not recursively enumerable

33 Views Asked by At

Let P(p) <=> for each x, comp(p,x) is defined.

Can anyone explain to me how to prove that P is not RE (recursively enumerable) ?