Baz, JuanDíaz, IreneGarmendia Salvador, LuisGómez González, DanielMagdalena, LuisMontes, SusanaPedrycz, Witold2024-05-302024-05-302024Juan Baz, Irene Díaz, Luis Garmendia, Daniel Gómez, Luis Magdalena, Susana Montes, Computable aggregations of random variables, Information Sciences, Volume 654, 2024, 119842.0020-025510.1016/j.ins.2023.119842https://hdl.handle.net/20.500.14352/104589Aggregation theory is devoted to the fusing of several values into a unique output that summarizes the given information. Typically, the aggregation process is formalized in terms of an increasing mathematical function that maps the input values to the result, fulfilling some boundary conditions. However, this formalization can be too restrictive for some scenarios. In some cases, the inputs can be seen as observations of random variables, the aggregation result being also a random variable. In others, the aggregation process can be identified as a program that performs the aggregation rather than a mathematical function. In this direction, the concepts of aggregation of random variables and computable aggregation have been defined in the literature. This paper is devoted to the definition of computable aggregation of random variables, which are computer programs, not functions, that aggregate random variables, not numbers. Special attention is given to different possible alternatives to modelize random variables and monotonicity. The implementation of some examples is also provided.engAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/journal article1872-6291https://doi.org/10.1016/j.ins.2023.119842https://www.sciencedirect.com/science/article/pii/S0020025523014275open accessAggregation functionsComputable aggregationsAggregation of random variablesProbability theorySoft ComputingCiencias12 Matemáticas11 Lógica1208 Probabilidad1209.03 Análisis de Datos