Post #2669078
2026-04-08 13:13 UTC
Divide-and-conquer algorithms are described by the notion of coalgebra-to-algebra morphism for some functor F.
The "divide" step is given by an F-coalgebra c, the "combine" step by an F-algebra a, and the whole algorithm h
satisfies the functional equation h = c; Fh; a. 2/8
Replies (1)
-
@cxandru@types.pl 2026-04-08 13:13
A a coalgebra is called recursive, if for every F-algebra a, the equation h = c; Fh; a admits a unique solution, i.e. can act as a definition. Our contribution is a novel sufficient criterion for all coalgebras for some functor to be recursive. 3/8