Hey all,
I didn't realize November was approaching so quickly! Next Thursday, Greg Bacon is going to speak a bit about the
Cook-Levin Theorem, which proves the boolean satisfiability problem is NP-complete. If you haven't met Greg, he's a detailed yet understandable teacher of most things functional. I'm looking forward to hearing him speak!
As an aside, anyone have any ideas for December's meeting? I was thinking it'd be interesting to talk about any Hacktober projects anyone worked on. I personally haven't done too much (gonna play catch up this weekend), but if y'all have done stuff I'd love to hear about it!
Take care,
Jason