The halting problem relates because in a similar way it is saying that there cannot be a single algorithm that solves everything within the system thus the system needs algorithms that can do "work" to solve complex problems. NP-complete problems are out of reach for today's classical compute systems and thus quantum computing could approach them and unlock them faster i.e. the speedup. This does reflect Godel's incompleteness theorems.
I need a shorter name for the whole genre of person that’s on way too many uppers and won’t stop using ChatGPT all night to make all their decisions, cause we keep running into them and for some reason all of them are obsessed with CS woo
maybe we’re really just witnessing what happens when your “nootropic” habit gets out of hand and you’re still in debt from gambling on crypto, so you get high as shit and convince yourself you’re a genius because whenever you read the tea leaves they tell you exactly what you expected to hear. this is, unfortunately, how cults tend to form.