Ackermann's function: A study in the efficiency of calling procedures | Zendy

Brian Wichmann | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Ackermann's function: A study in the efficiency of calling procedures

Author(s) -

Brian Wichmann

Publication year - 1976

Publication title -

bit numerical mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.904

H-Index - 59

eISSN - 1572-9125

pISSN - 0006-3835

DOI - 10.1007/bf01940783

Subject(s) - ackermann function , minicomputer , computer science , variation (astronomy) , arithmetic , function (biology) , line (geometry) , programming language , algorithm , mathematics , operating system , physics , geometry , astrophysics , inverse , evolutionary biology , biology

A six line recursive procedure is used to assess the efficiency of the procedure calling mechanism in ALGOL-like languages. The results from some 40 systems varying from ALGOL 68 and PL/I to System Implementation Languages for minicomputers are presented and compared. A hundred to one variation in performance occurs with this test, the major reasons for which are given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research