ora@midwest.social to 196@lemmy.blahaj.zoneEnglish · 17 days agoThe letter of the rule, if not the spiritmidwest.socialimagemessage-square53linkfedilinkarrow-up1121arrow-down18
arrow-up1113arrow-down1imageThe letter of the rule, if not the spiritmidwest.socialora@midwest.social to 196@lemmy.blahaj.zoneEnglish · 17 days agomessage-square53linkfedilink
minus-squareguynamedzero@piefed.zeromedia.viplinkfedilinkEnglisharrow-up3·17 days agotree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(3))))))))))))
minus-squareguynamedzero@piefed.zeromedia.viplinkfedilinkEnglisharrow-up4·17 days agoI’m unfamiliar, what is BB?
minus-squaresem@piefed.blahaj.zonelinkfedilinkEnglisharrow-up7·17 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.workscakelinkfedilinkEnglisharrow-up1·17 days agohttps://en.wikipedia.org/wiki/Busy_beaver
minus-squareitslilith@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up2·15 days agotree() is a different function to TREE()
tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(tree(3))))))))))))
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
tree() is a different function to TREE()