A machine independent theory of the complexity of recursive functions (Blum complexity axioms)英文资料.pdfVIP

*] 5i A Machine-Independent i ~eoy of the Complexity of Reeursive Functions MANUEL BLUM Massachusetts Institute of Technology,* Cambridge, Massachusetts ABSTRACT. The number of steps required to compute a function depends, in general, on the type of computer that is used, on the choice of computer program, and on the input-output code. Nevertheless, the results obtained in this paper are so general as to be nearly independent of