An inherently iterative computation of Ackermann's function

DOI10.1016/0304-3975(88)90046-1zbMath0651.03031OpenAlexW2242858339MaRDI QIDQ1106200

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)

Related Items (1)

An inherently iterative algorithm for the Grzegorczyk hierarchy

Cites Work

• Unnamed Item
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Efficiency of a Good But Not Linear Set Union Algorithm
• Ackermann's function: A study in the efficiency of calling procedures
• Recursion and double recursion

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