I think a good model for software complexity is the crossing number from graph theory. [1] If a problem remains possible to describe using a planar graph then y

I think a good model for software complexity is the crossing number from graph theory. [1] If a problem remains possible to describe using a planar graph then you must consider at most four components simultaneously (as a K4 is the maximal connected graph with a planar embedding). [1]https://en.m.wikipedia.org/wiki/Crossing_number_(graph_theory) https://en.m.wikipedia.org/wiki/Crossing_number_(graph_theor...