Complexity

From BITPlan cr Wiki
Revision as of 15:58, 30 September 2024 by Wf (talk | contribs) (Created page with "A definition for complexity in the context of semantification of workflows is not easy to find or create. "Complexity" is a broad term used in different contexts and needs dis...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A definition for complexity in the context of semantification of workflows is not easy to find or create. "Complexity" is a broad term used in different contexts and needs disambiguation.

Let's start with a simple naive example: a simple versus a complex relationship. We would assume that simplicity correlates with small size and complexity with large size. The more people (nodes) involved in a relation the more effort it is to keep the state of the network in order. In a knowledgegraph G=(V,E) it might therefore make sense to count the nodes and edges and the depth and breadth of the structure the graph might build (e.g. if it is a tree).

The cost of traversing the network and the benefit of doing so will most likely also influence the complexity.

So a first step in this train of source is: simple relations have few participants, low transaction costs and high transaction benefits. E.g. buying an ice cream in summer might lead to a good relation to the ice cream vendor if the price is low and the ice most tasty and the ice cream parlor was only a walk away on a hot summer day - you did not have to wait in line and the person selling was kind to you (and of course so have you been).

Formally ...