Abstract
It is shown here that using the Kleene’s normal form for partial recursive functions (p.r. functions) it is possible to develop a different normal form which will give a relation between these p.r. functions and certain related step-counting ones. Also this new form suggests an interesting serial expansion in terms of minimal functions of these p.r. functions.
The notion of conjugated systems of computational complexity is eventually introduced.
Get full access to this article
View all access options for this article.