> But how can complexity be understood in therms of "topology" and "graph > theory"? What about the complexity of a sorting algorithm? Are you sure you > know what topology is?
I'm not talking about time complexity. That's a totally different issue. Whether an algorithm is O(n) or O(n^3) is not my concern here. Instead, I'm talking about the complexity of the causal network of a program. I think we're talking past each other because the words we're using complexity, size, etc. have multiple definitions and we're not using the same ones. So for clarity, here are my definitions: size: the binary size (or size in lines of code) of a piece of software complexity: a measure of the number and valency of causal connections amongst objects in a piece of software >From my definition of complexity, I think it's pretty clear how graph theory and topology come in to play. wes _______________________________________________ fonc mailing list [email protected] http://vpri.org/mailman/listinfo/fonc
