better wording for why Lemma 1 proof doesn't work

rnni_polynomial.tex

@@ -565,7 +565,7 @@ \section{For what $\rho$ is $\decprob{\rho}$ polynomial?}
 \label{lemma:if_decprob_poly}
 \end{lemma}
 
-\todo[inline]{This proof has an error: The argument as it is written now relies on the fact that there exists $\decprob{\rho} \in \fpc$ \textbf{uniformly in} $\rho$.
+\todo[inline]{This proof has an error: The argument as it is written now relies on the fact that there exists an algorithm that computes $\decprob{\rho} \in \fpc$ \textbf{uniformly in} $\rho$.
 This has to be proven to prove the lemma.
 Idea for this proof: There are only finitely many values of $\rho$ where shortest paths go via different trees.}
 \proof