We explore the problem of writing explicit formulas for integer functions. We demonstrate that this can be done using elementary machinery for a wide class of functions. Constructive methods are given for obtaining formulas for computable functions and for functions in the arithmetical hierarchy. We include a short background on computability theory.
Simic, Department of Mathematics, University of Arizonaksimic@math.arizona.edu
"Formulas for Computable and Noncomputable Functions,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 7
, Article 2.
Available at: http://scholar.rose-hulman.edu/rhumj/vol7/iss2/2