[nl]

Undecidable isn't uncomputable.

"Computable" can mean probabilistic, and classical computers can function over probability distributions just fine.

[salutis]

This is incorrect. An undecidable problem is one for which no algorithm can compute the correct result for every given instance. Probabilistic classical computation is irrelevant here.