2.5 SEMI-COMPUTABLE RELATIONS; UNSOLVABILITY
We next define a 
-counterpart of 
* and * and look into some of its closure properties.
2.5.0.3 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 ...
Get Theory of Computation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
