2 ms·
The implication was that the project couldn't succeed because the management didn't understand basic automata theory, and insisted the programmers use only regu
by cynicalkane 16y ago
The implication was that the project couldn't succeed because the management didn't understand basic automata theory, and insisted the programmers use only regular expressions. Presumably the regular expressions were being invoked by a Turing-complete programming language. Unless management decided that Turing-complete programming languages were not allowed, as well.
- stcredzero 16y agoAmazing how often Turing-complete programming languages aren't utilized to their full potential. (And for the record, no I wasn't on that project. I have a CS degree and I remember automata.)