Non-definability of the Ackermann function with type 1 partial primitive recursion

DOI10.1007/S001530050077MaRDI QIDQ1816488zbMATH OpenOpenAlexFDO

Authors Karl-Heinz Niggl

Publication date 15 December 1996

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001530050077

zbMATH Keywords

Ackermann functioncontinuous functionalspartial primitive recursive functionalsimply typed term system[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=G%EF%BF%BD%EF%BF%BDdel+recursors&go=Go G��del recursors]subrecursiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• The Ackermann functions are not optimal, but by how much?
• scientific article; zbMATH DE number 3912360
• A restricted computation model on Scott domains and its partial primitive recursive functionals
• Subrecursive functions on partial sequences
• Primitive recursion and \(\mu\)-recursivity

Cited in

(2)

• Impossibility of finite generation of partial recursive functions by a unary isotone operation
• The Ackermann functions are not optimal, but by how much?

This page was built for publication: Non-definability of the Ackermann function with type 1 partial primitive recursion

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