JokaJukka@lemmy.world to Memes@lemmy.ml · 1 year agoThe future is now, old manlemmy.worldimagemessage-square15fedilinkarrow-up10arrow-down10
arrow-up10arrow-down1imageThe future is now, old manlemmy.worldJokaJukka@lemmy.world to Memes@lemmy.ml · 1 year agomessage-square15fedilink
minus-squareShortN0te@lemmy.mllinkfedilinkarrow-up0·1 year agoIn short, everything that is Turing-conplete can compute anything.
minus-squarephotonic_sorcerer@lemmy.dbzer0.comlinkfedilinkEnglisharrow-up0·edit-21 year agoExcept for that which is non-computable.
minus-squareShortN0te@lemmy.mllinkfedilinkarrow-up0·1 year agoNew to me that there is proof that something is not computable.
minus-squareMacFearrs@lemmy.dbzer0.comlinkfedilinkarrow-up0·1 year 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.
That doesn’t compute.
New to me that there is proof that something is not computable.
The most obvious answer to this is the halting problem.
Like yo Mama’s weight!
SCNR