Set of strings
S
is m-complete if both of the following are true.
S
is partially computable.
X
≤
m
S
for every partially computable set
X
. .