2 ms·
Even for things like regular expressions checking for equality can cost exponential time. Whether something is exponential or undecidable is pretty much irrelev
by adrianN 7y ago
Even for things like regular expressions checking for equality can cost exponential time. Whether something is exponential or undecidable is pretty much irrelevant if you want to run the algorithm as part of compilation.
- guerrilla 7y agoGood thing that's not relevant in general then.