The Turing machine always halts: it is known as a decider and is said to decide the recursive language.
Turingov stroj uvijek staje - poznat i pod nazivom odlučitelj - i kažemo da odlučuje rekurzivni jezik.