General Recursive Functions
From MaRDI portal
Cited in
(20)- Primitive iteration and unary functions
- Generation of invertible functions
- Computable stack functions for semantics of stack programs
- General iteration and unary functions
- A class of recursive permutations which is primitive recursive complete
- Turing completeness of water computing
- A grammar of functions
- A grammar of functions. II
- Bases for algebras of recursive functions
- Bases in algebras of partially recursive functions
- Function operators spanning the arithmetical and the polynomial hierarchy
- Persistent Computations of Turing Machines
- A Groupoid of Isomorphic Data Transformations
- Definitional schemes for primitive recursive and computable functions
- On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
- Iteration on notation and unary functions
- Finite Generation of Recursively Enumerable Sets
- Core Tarski and Core McGee
- On the representation of partial recursive functions as superpositions
- Closure functions and general iterates as reflectors
This page was built for publication: General Recursive Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5801336)
