in Theory of Computation
207 views
0 votes
0 votes
Let $A$ be the language containing only the single string $s$, where

$s = \left\{\begin{matrix} \text{0 if life never will be found on Mars} \\ \:\: \text{1 if life will be found on Mars someday} \end{matrix}\right.$

Is $A$ decidable? Why or why not? For the purposes of this problem, assume that the question of whether life will be found on Mars has an unambiguous $YES$ or $NO$ answer.
in Theory of Computation
by
207 views

Please log in or register to answer this question.

Related questions