New answers tagged computability
1
If excluded middle holds then the function is computable, as follows.
Consider the set
$$S = \{n \in \mathbb{N} \mid \text{there are $n$ consecutive 9's in $\pi$}\}.$$
By excluded middle $S$ is bounded or unbounded. Consider both possibilities:
If $S$ is bounded then it has a largest element $m \in S$. The function $f$ can be computed as follows: on input $...
Top 50 recent answers are included
