JokaJukka@lemmy.world to Memes@lemmy.ml · 2 年前The future is now, old manlemmy.worldimagemessage-square16linkfedilinkarrow-up1443arrow-down19
arrow-up1434arrow-down1imageThe future is now, old manlemmy.worldJokaJukka@lemmy.world to Memes@lemmy.ml · 2 年前message-square16linkfedilink
minus-squareShortN0te@lemmy.mllinkfedilinkarrow-up32·2 年前In short, everything that is Turing-conplete can compute anything.
minus-squarephotonic_sorcerer@lemmy.dbzer0.comlinkfedilinkEnglisharrow-up14·2 年前Except for that which is non-computable.
minus-squareShortN0te@lemmy.mllinkfedilinkarrow-up5·2 年前New to me that there is proof that something is not computable.
minus-squareMacFearrs@lemmy.dbzer0.comlinkfedilinkarrow-up17·2 年前The 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.