Lovely article.<p>Hylomorphisms are actually Turing complete. Think about them as &quot;build the call graph of the algorithm on this input&quot; followed by &quot;reduce the call graph of the algorithm on this input&quot;. Since your coalgebra can build a potentially infinite call graph, you can express even algorithms that don&#x27;t terminate on certain inputs.