2.5 SEMI-COMPUTABLE RELATIONS; UNSOLVABILITY
We next define a -counterpart of * and * and look into some of its closure properties.
184.108.40.206 Definition. (Semi-computable Relations) A relation P() is called semi-computable or semi-recursive iff for some f , we have, for all n,
The set of all semi-computable relations is denoted by *.
If in (1) above, then we say that “a” is a semi-computable index ...