Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems

AbstractResults are presented which show precise ways in which recursion rests on very simple computational bases which do not support diagonalization. A method based on recursion and making no use of diagonalization is given for proving lower bounds on computational complexity. Thus the intractability of computational problems such as Presburger arithmetic does not depend on diagonalization