Say a Non-Deterministic Turing Machine is in a state $q\_1$ and it reads symbol $a$ from its tape.
Is it possible to have two different transitions:

$$(q\_1,a) \rightarrow (q\_{accept}, <space>, L)$$

and

$$(q\_1,a) \rightarrow (q\_{reject}, <space>, L)$$