T-completeness captures Turing-decidability implications while m-completeness only captures many-one...
This proposition has not been edited since the history system was added.