Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
0 answers
301 views

The expressiveness of functions computable on trees

Motivation: Let's define a function computable on a $k$-ary tree as a function composed with simpler computable functions defined at each node such that a function of this kind defined on a binary ...