Iteration on notation and unary functions

DOI10.1002/malq.201200055zbMath1349.03040OpenAlexW1892457146MaRDI QIDQ5396224

Stefano Mazzanti

Publication date: 5 February 2014

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201200055

zbMATH Keywords

computable functionsNC\(\mathrm{NC}^1\)\(\mathrm{AC}^0\)concatenation recursion on notation\(\mathrm{TC}^0\)

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Succinct iterative characterizations of primitive computable unary functions
• Implicit characterizations of FPTIME and NC revisited
• Primitive iteration and unary functions
• General iteration and unary functions
• Feasible mathematics II. Based on a workshop, held at the Cornell University, Ithaca, NY, USA, May 28-30, 1992
• Bounded iteration and unary functions
• Parity, circuits, and the polynomial-time hierarchy
• Another simplification of the recursion scheme
• Iterative Characterizations of Computable Unary Functions: A General Method
• Unary primitive recursive functions
• A reduction of the recursion scheme
• Simplifications of the recursion scheme
• Primitive recursive functions
• General Recursive Functions

This page was built for publication: Iteration on notation and unary functions