Partially-additive monoids (pams) were introduced by Arbib and Manes ([1]) in order to provide an algebraic approach to the semantic of recursion in theoretical computer science. Here we extend the range of application of pams for capturing information theory concepts as componibility and sequential continuity, which arise naturally in this framework.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados