Evenja®

Wikipedia : Bayesian network is a directed acyclic graphs whose nodes represent random variables in the Bayesian sense: they may be observable quantities, latent variables, unknown parameters or hypotheses. Edges represent conditional dependencies; nodes that are not connected represent variables that are conditionally independent of each other. Each node is associated with a probability function that takes as input a particular set of values for the node's parent variables and gives the probability of the variable represented by the node.

As defined above, in bayesian network each “nodes represent random variables” and “each node is associated with a probability function”. This mean there is a design of the bayesian network that define exactly every change of values by a process inside the “probability function”.

In Evenja it is not a “function” that decide to change the data. But the content of the data it self.

The content of the data, “What”, “When” and in which node “Where” they are define the next node.

More details on file evenja_bayesien_EN.pdf to check the difference with the Bayesian approach and the analogy with the Qbism.

The definition of qbism from Wikipedia will show the deep similarity between the way to analyze the object with Evenja.

Evenja is the first programming language that takes into account the “feeling and experience” of the programmer, and as it is called “participatory realism”, it eliminates the idea of necessarily obtaining 100% “efficiency” on the computer problem to be solved.

Another definition of Qbism on “University of Massachusetts Boston”.