In turing machine the problem of accepting the string is a membership problem in TM ie either the TM will halt or not we dont know therefore the problem comes under the semi decidable problem again we got halting problem and the string is finite therefore we can say it as semi decidable only