Computational Complexity Defined as Minimal Steps

The computational complexity of a thing or process is the absolute minimal number of simple steps required to go from a starting point to it—not the number some person happened to use; a theorem's difficulty is its minimal number of logical operations from the postulates, so a simply stated theorem like the four-color theorem can be highly complex while Pythagoras is simple.