Hopefully that explains the nature of the explosion of entities / complexity; let me know if I can expand on anything. It does not satisfy me. One can show tha

Hopefully that explains the nature of the explosion of entities / complexity; let me know if I can expand on anything. It does not satisfy me. One can show that a regular expression or finite state machine is limited in specific ways, as compared to a stack machine or a Turing machine. One can write proofs concerning the number of states a specific machine can be in, given an input of a certain length. The explosion in complexity can be quantified, as can the impact on the effectiveness of testing. By comparison, "using techniques such as normalization you can also structure around potential anomalies that add unwanted complexity," is just an aphorism.