Analyzing Non-deterministic Computable Aggregations

Traditionally, the term aggregation is associated with an aggregation function, implicitly assuming that any aggregation process can be represented by a function. However, the concept of computable aggregation considers that the core of the aggregation processes is the program that enables it. This new concept of aggregation introduces the scenario where the aggregation can even be non-deterministic. In this work, this new class of aggregation is formally defined, and some desirable properties related with consistency, robustness and monotonicity are proposed.