The problem is that while quantum superposition can be thought of as "all possible states simultaneously," it is not in general possible to choose properties of the state you get at the end (called "postselection" in the quantum computing literature). All you can do is adjust the probabilities of the different states, & for some problems, we do not know a way to make the desired state likely enough to do any better than a square root improvement in running time over a classical computer. So for that sort of problem, an O(2^n) algorithm would become O(2^(n/2)).
Apart from quantum suicide (which depends on various unproven assumptions & is technically nontrivial even if theoretically possible), there is no known way to do postselection.
Certain platforms have rampant trademark infringement in the programs offered on them, especially games. Does the fact that trademark holders (including Nintendo) continue to ignore them cause their marks to be genericized on those specific platforms? (Or maybe they are unaware of the infringement...quite possible, but I am not sure if that matters legally.)
(Not asking for legal advice—just curious...I was actually wondering about that just a few days ago.)
Regarding lazy programmers: I have written programs where I used packed bitfields & still ended up needing around 4-8 GB RAM. I was counting how many of something existed & marking them off as they were discovered—enumerating in (much) less space would make it take a lot longer, barring a computational complexity breakthrough (or maybe spending weeks discovering a different special-purpose enumeration method).
But for the most part, programs do seem to take up more space than necessary these days. E.g. a text editor should not need over 1 GB RAM. Even with unlimited undo & 30 or so documents open, each is not very large (under 128 KB), & I cannot type that fast.
"Dump the condiments. If we are to be eaten, we don't need to taste good." -- "Visionaries" cartoon