An inherently iterative computation of Ackermann's function

DOI10.1016/0304-3975(88)90046-1MaRDI QIDQ1106200zbMATH OpenOpenAlexFDO

Authors Jerrold W. Grossman, R. Suzanne Zeitman

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90046-1

zbMATH Keywords

iterative algorithmiterative proceduretime-complexityspace-complexityAckermann's functionAckermann-Peter's function

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Recommendations

• La fonction d'Ackermann : un nouveau mode de dérécursivation
• An inherently iterative algorithm for the Grzegorczyk hierarchy
• Publication:3026989
• The Ackermann functions are not optimal, but by how much?
• scientific article; zbMATH DE number 3954294

Cites work

• scientific article; zbMATH DE number 3876619 (Why is no real title available?)
• Ackermann's function: A study in the efficiency of calling procedures
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Efficiency of a Good But Not Linear Set Union Algorithm
• Recursion and double recursion

Cited in

(3)

• An inherently iterative algorithm for the Grzegorczyk hierarchy
• ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT
• La fonction d'Ackermann : un nouveau mode de dérécursivation

This page was built for publication: An inherently iterative computation of Ackermann's function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106200)