Possible Duplicate:
Show $f$ is primitive recursive, where $f(n) = 1$ if the decimal expansion of $\pi$ contains $n$ consecutive $5$'s
$L = \{i\mid f(i)=1\}$ $f(i)$ equals $1$ if there is a sequence of at least $i$ consecutive $5$s in the decimal expansion of $\pi$, and $0$ otherwise.
Is there a total Turing Machine that can represent that language for any $i$?