On a complexity-based way of constructivizing the recursive functions (Q922528)

This paper discusses the problem of constructivizing the recursive functions. Various attempts to this problem have been analysed. It is suggested that the class of effectively (or constructively) computable functions can be captured with a broad possibility by some type of hierarchies which are based on some kind of complexity defined in the paper. The hierarchies of this type can be constructively generated, and will be (under some conditions) progressive as being shown in the main theorem of the paper.