scientific article; zbMATH DE number 3954294

MaRDI QIDQ3723717zbMATH OpenFDO

Authors Sanda-Monica Tătărâm

Publication date 1984

zbMATH Keywords

Ackermann-Péter functioncontext-sensitive language

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Formal languages and automata (68Q45)

Recommendations

• Publication:3026989
• scientific article; zbMATH DE number 23836
• scientific article; zbMATH DE number 19776
• The Ackermann functions are not optimal, but by how much?
• scientific article; zbMATH DE number 3912360

Cited in

(7)

• Super-exponentials nonprimitive recursive, but rudimentary
• An inherently iterative computation of Ackermann's function
• scientific article; zbMATH DE number 4014690 (Why is no real title available?)
• scientific article; zbMATH DE number 3912360 (Why is no real title available?)
• scientific article; zbMATH DE number 23836 (Why is no real title available?)
• The Ackermann functions are not optimal, but by how much?
• Primitive recursion and \(\mu\)-recursivity

This page was built for publication:

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