3 ms·

I've wondered about this myself. I've tried imagining nodes as types and edges as functional transformations between them. Then there are essentially topologica

I've wondered about this myself. I've tried imagining nodes as types and edges as functional transformations between them. Then there are essentially topological "moves" that you can make on your graph that shift the type data around and change the structure of your graph. Two programs are equivalent if the type graph of program 1 can be transformed into the other by these moves. This is all fuzzy thinking and not fully baked at all, but compilers do this all the time to construct optimized "equivalent" programs which gives me hope. I don't have the background in CS to pursue this rigorously though.

qppo 6y ago
I'm sure this question has been studied in a thesis or ten in the field of computational sociology (which I didn't know existed until I googled the term). I think there are a number of ways to state this problem in terms of graphs and their transformations, that's usually the case when it comes to abstractions. I think the question more worth answering is the methods by which real world organizational and business problems/processes can be expressed as graphs and their transformations, and how to perform analysis of those graphs for given queries about their nature. I know a few people who do this but not as a rigorous CS discipline, it's often called Industrial Organizational Psychology, Process Optimization, etc etc. Its a complex interdisciplinary field.