A Difference in Complexity Between Recursion and Tail Recursion

Bhaskar, S

Bhaskar, S (reprint author), Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA.; Bhaskar, S (reprint author), IU Bloomington, Dept Math, Bloomington, IN 47405 USA.

THEORY OF COMPUTING SYSTEMS, 2017; 60 (2): 299

Abstract

There are several ways to understand computability over first-order structures. We may admit functions given by arbitrary recursive definitions, or we......

Full Text Link