Re:Computation as a Universal and Fundamental Concept
by salutis on Saturday July 11, 2026 @07:29PM
(#48876830)
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.
"Computable" can mean probabilistic, and classical computers can function over probability distributions just fine.