Undecidable isn't uncomputable. "Computable" can mean probabilistic, and classic... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

nl 39 days ago | parent | context | favorite | on: Computation as a universal and fundamental concept

Undecidable isn't uncomputable.

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

salutis 38 days ago [–]

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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact