problem of indeterminacy

The indeterminacy problem in computer science is a statement that a polynomial time-wave is equal to a NON-polynomial time-wave under a hypothetical circumstance.

The problem of indeterminacy states that the draw-distance of a transfinite surface is equivalent to the surface area of a next-adjacent complex number.

A solution to the Riemann Hypothesis states that this is indeed the case.