ora@midwest.social to 196@lemmy.blahaj.zoneEnglish · 6 days agoThe letter of the rule, if not the spiritmidwest.socialimagemessage-square54linkfedilinkarrow-up1134arrow-down19
arrow-up1125arrow-down1imageThe letter of the rule, if not the spiritmidwest.socialora@midwest.social to 196@lemmy.blahaj.zoneEnglish · 6 days agomessage-square54linkfedilink
minus-squareguynamedzero@piefed.zeromedia.viplinkfedilinkEnglisharrow-up3·6 days agotree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(3))))))))))))
minus-squareitslilith@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up2·4 days agotree() is a different function to TREE()
minus-squareguynamedzero@piefed.zeromedia.viplinkfedilinkEnglisharrow-up4·6 days agoI’m unfamiliar, what is BB?
minus-squaresem@piefed.blahaj.zonelinkfedilinkEnglisharrow-up7·6 days agoBusy beaver algorithm. https://wiki.bbchallenge.org/wiki/Busy_Beaver_Functions Starting definition: the largest number of steps (or shifts) that any Turing machine (of a certain size, and starting with a blank tape) takes before halting. Computerphile does a good treatment on it. https://www.youtube.com/watch?v=CE8UhcyJS0I
minus-squareBodilessGaze@sh.itjust.workslinkfedilinkEnglisharrow-up2·6 days agohttps://en.wikipedia.org/wiki/Busy_beaver
tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(3))))))))))))
tree() is a different function to TREE()
BB(tree(3))
I’m unfamiliar, what is BB?
Busy beaver algorithm. https://wiki.bbchallenge.org/wiki/Busy_Beaver_Functions
Starting definition: the largest number of steps (or shifts) that any Turing machine (of a certain size, and starting with a blank tape) takes before halting.
Computerphile does a good treatment on it. https://www.youtube.com/watch?v=CE8UhcyJS0I
https://en.wikipedia.org/wiki/Busy_beaver