Turing completeness among c.e. sets requires that K can simulate any c.e. set's membership problem, ...