Post's simple sets are Turing-complete but lack many-one completeness, establishing that ≤_T and ≤_m...
This proposition has not been edited since the history system was added.