April 2012
Intermediate to advanced
416 pages
10h 40m
English
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 ...
Read now
Unlock full access