Ackermann's function: A study in the efficiency of calling procedures
From MaRDI portal
Publication:4086685
DOI10.1007/BF01940783zbMath0323.68010MaRDI QIDQ4086685
Publication date: 1976
Published in: BIT (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (1)
Uses Software
Cites Work
This page was built for publication: Ackermann's function: A study in the efficiency of calling procedures