It is the same thing as in an NFA or a non-deterministic PDA.
Specifically, a word w is in the language of a TM if there exists a set of legal configurations leading to an accepting one.
If you are "stuck" then either there exists another "computation path" that leads to an accepting configuration or that
the word is indeed not in the language.
The above discussion only holds for non-deterministic TMs of course.