What does it mean for a non$-$deterministic Turing machine to accept its input.

Question $4$ options:

$1)$

A non$-$deterministic Turing Machine accepts its input if every branch of its computation either ends in an accepting state or goes on forever.

$2)$

A non$-$deterministic Turing Machine accepts its input if every branch of its computation ends in an accepting state.

$3)$

A non$-$deterministic Turing Machine accepts its input if at least one branch of its computation ends in an accepting state.

Question $5(0\mathrm{.}5$ points$)$

$$

There are more real numbers $($possible outputs that you might want to compute$)$ than there are integers $($possible computer programs$)$

Question $5$ options:

$1)$ True$2)$ False

Question $1$ options:

$1)$ True$2)$ False