Set of strings S is m-complete if both of the following are true.

1. S is partially computable.
2. X ≤_m S for every partially computable set X. .