@JokaJukka to [email protected] • 10 months agoThe future is now, old manimagemessage-square17arrow-up1444arrow-down18
arrow-up1436arrow-down1imageThe future is now, old man@JokaJukka to [email protected] • 10 months agomessage-square17
minus-square@[email protected]linkfedilink32•10 months agoIn short, everything that is Turing-conplete can compute anything.
minus-square@[email protected]linkfedilinkEnglish14•edit-210 months agoExcept for that which is non-computable.
minus-square@[email protected]linkfedilink5•10 months agoNew to me that there is proof that something is not computable.
minus-square@[email protected]linkfedilink17•10 months agoThe most obvious answer to this is the halting problem.
In short, everything that is Turing-conplete can compute anything.
Except for that which is non-computable.
Like yo Mama’s weight!
SCNR
New to me that there is proof that something is not computable.
The most obvious answer to this is the halting problem.
That doesn’t compute.