> The amount of compute required for R1 to determine that strawberry has 3 Rs is hilarious.. How about the amount of compute to take a buggy hextree implementa

> The amount of compute required for R1 to determine that strawberry has 3 Rs is hilarious.. How about the amount of compute to take a buggy hextree implementation I've been poking at for a few years and completely rewrite it into a fully functioning implementation (with test cases) without me having to write a single line of code? Well...other than me having to break out the printf debugger to help with tracking down some deep bugs that is. I've been trying to get the original implementation to work correctly for so long I don't even remember what I wanted to use it for in the first place, I just mess with it a bit here and there when I have nothing better to do. And that's just me, a half-assed self-taught junior woodchuck coder, playing around to see what all the hype is about. I can only imagine that I'm giving them valuable training data as some of the bugs were very deep and took a whole lot of 'thinking' to track down the root cause. It does take a bit of prodding to get it to look in the right place but so far it has found and fixed them all. The last bug was an overflow in the tree iterator's stack it uses to track state across iterations that I was concerned would time out as it was thinking for a long, long time. I'm not really one to defend the robots but this one is actually uesful. --edit-- Oh... I guess that's a meme now. Nothing to see here, move along...