Even if all NP problems could be solved in sub-exponential time, it would not imply that NP ≠ EXP. It seems that many people here are confused about what EXP means – it’s the set of all problems that can be solved in at most exponential time, including those in P.
This is not a proof of NP ≠ EXP. NP ≠ EXP would mean that there is a problem that can be solved in exponential time, but not in non-deterministic polynomial time. That’s completely different from what they have shown.
Typically, in informal writing, you write it as you say it in your dialect, and in formal writing, you use the standardized form of the language if there is one.
It’s much cheaper, having an unlimited plan for just $10/year, or even less if you choose usage-based pricing. Otherwise I don’t know as I’ve never used Migadu.
> Insisting on hand-coding a project for these reasons is akin to choosing a shovel over an excavator
This is a great analogy because an excavator is much more expensive than a shovel and can’t fit into small places, so it’s only worth it for large projects.
reply