If a Turing machine is used for the computation of functions it only has one "end state". When the machine comes to that state it is halted and the result of the function (depending on the input) can be found on the tape.