Is this function $k:\mathbb{N}\to\mathbb{N}$ computable, which is defined as:
$$ k(n)=\begin{cases}\text{the position of the first $n$ consecutive 9's in $\pi$}\\0\text{ if there is no such position}\end{cases} $$
The term "fugitive integer" is taken from
Intuitionism: An Inspiration?
Wim Veldman - 2021
https://arxiv.org/abs/2102.01561
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 $n$, if $n > m$ output $0$, otherwise compute the decimal expansion of $\pi$ until $n$ consecutive 9's are encountered, and output the position.
If $S$ is unbounded then $f$ can be computed as follows: on input $n$, compute the decimal expansion of $\pi$ until $n$ consecutive 9's are encountered, and output the position.
So, you see, $f$ is computable, but it is prety difficult to know which of the two candidate algorithms for it is the right one. (Note: we do not have to compute $m$ in the first case, we simply hard-wire it into the alrogithm, whatever it is.)