The Testing Algorithmic and Application Skills (TAaAS) project was launched in the 2011/2012 academic year to test first year students of Informatics, focusing on their algorithmic skills in traditional and non-traditional programming environments, and on the transference of their knowledge of Informatics from secondary to tertiary education. The results of the tests clearly show that students ...

In the discussion of the comparison of logical complexity to algorithmic complexity, we concluded that logical complexity represents a relaxed interpretation of algorithmic complexity because it ignores patterns which can not be ignored in a rigorous application of algorithmic complexity. Logical complexity accounts for state changes, but does not differentiate between the actual states and the...

Abstract Machine-learned systems are in widespread use for making decisions about humans, and it is important that they fair , i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness whose models unknown, but assumed to have a Markov chain structure. introduce specification language can model many common properties, such as dem...

The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.