One indication of logic gate level programming's enduring success is that algorithmic complexity can be expressed in terms of the minimum number of gates involv

One indication of logic gate level programming's enduring success is that algorithmic complexity can be expressed in terms of the minimum number of gates involved. There are proofs relating to NP completeness et. al. that cite gate count as proof of an algorithm's membership in such and such complexity class.