Iteration on notation and unary functions
From MaRDI portal
Recommendations
Cites work
- A reduction of the recursion scheme
- Another simplification of the recursion scheme
- Bounded iteration and unary functions
- Feasible mathematics II. Based on a workshop, held at the Cornell University, Ithaca, NY, USA, May 28-30, 1992
- General iteration and unary functions
- General Recursive Functions
- Implicit characterizations of FPTIME and NC revisited
- Iterative Characterizations of Computable Unary Functions: A General Method
- Parity, circuits, and the polynomial-time hierarchy
- Primitive iteration and unary functions
- Primitive recursive functions
- Simplifications of the recursion scheme
- Succinct iterative characterizations of primitive computable unary functions
- Unary primitive recursive functions
Cited in
(4)
This page was built for publication: Iteration on notation and unary functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396224)