0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 17 hours agoNot my problem sortinfosec.pubimagemessage-square42fedilinkarrow-up1556arrow-down110
arrow-up1546arrow-down1imageNot my problem sortinfosec.pub0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 17 hours agomessage-square42fedilink
minus-squareAllero@lemmy.todaylinkfedilinkarrow-up14·8 hours agoThe most beautiful thing about this program is that it would work. Various bit flips will once lead to all numbers being in the correct order. No guarantee the numbers will be the same, though…
minus-square🔍🦘🛎@lemmy.worldlinkfedilinkEnglisharrow-up1·9 minutes agoReminds me of a program in Homestuck. It’s code that iterates until the author/universe dies, then executes some unknown code. The coding language is ~ath, or TilDeath.
minus-squarefallingcats@discuss.tchncs.delinkfedilinkarrow-up4·3 hours agoThose bitflips are probably more likely to skip the section erroneously than waiting for the array to be sorted.
minus-squareAllero@lemmy.todaylinkfedilinkarrow-up1·28 minutes agoFair enough! But won’t they flip again to start the program?
minus-squareMidnitte@beehaw.orglinkfedilinkEnglisharrow-up6·6 hours agoMight also take a very long time (or a large amount of radiation).
The most beautiful thing about this program is that it would work.
Various bit flips will once lead to all numbers being in the correct order. No guarantee the numbers will be the same, though…
Reminds me of a program in Homestuck. It’s code that iterates until the author/universe dies, then executes some unknown code. The coding language is ~ath, or TilDeath.
Those bitflips are probably more likely to skip the section erroneously than waiting for the array to be sorted.
Fair enough! But won’t they flip again to start the program?
Might also take a very long time (or a large amount of radiation).