We suppose the natural numbers given in a canonical notation (the simplest, for the purposes of computability theory, is followed by a finite number of successor symbols), and ask that the computation be given in that notation.