Intuitively I'd say you're probably right. But computation theory is full of counter-intuitive results. Your statement might be provable by adapting the argument that Σ(n) is not always computable. Something like computing the sum would require solving some version of the halting problem.

Perhaps add a small edit to your article to highlight that this particular statement isn't to be taken as a mathematical proof?