It is not the case that Limited recursion on notation recurses on the binary length of y — proportional to log_2(y) — rather than on the value of y itself as in ordinary primitive recursion, so the number of recursive steps is bounded by the bit-length of the input
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.