It is not the case that Turing completeness among c.e. sets requires that K can simulate any c.e. set's membership problem, but this presupposes a fixed model of computation whose universality is not logically necessary.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.