No. Every computable language is also partially computable. (A program that decides a S also partially decides S. It simply does not take advantage of being allowed to loop forever when the answer is no.)