Turing Acceptable means Turing Recognizable. And Every Turing Decidable is Turing Recognizable.
Turing Acceptable simply means that There is some TM for respective Language/Problem. So, If There is some Total TM(Halting TM) for that Language/Problem then We will say Turing Decidable.
Turing Decidable is Stronger Statement(When It is True) than Turing Acceptable/ Turing Recognizable.