Hylomorphisms are actually Turing complete. Think about them as "build the call graph of the algorithm on this input" followed by "reduce the call graph of the algorithm on this input". Since your coalgebra can build a potentially infinite call graph, you can express even algorithms that don't terminate on certain inputs.
1 comment
[ 2.9 ms ] story [ 11.4 ms ] threadHylomorphisms are actually Turing complete. Think about them as "build the call graph of the algorithm on this input" followed by "reduce the call graph of the algorithm on this input". Since your coalgebra can build a potentially infinite call graph, you can express even algorithms that don't terminate on certain inputs.