It is not the case that Simple sets being Turing-complete doesn't entail they lack many-one completeness; Post proved they're not m-complete, which is consistent.
?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.