On a complexity-based way of constructivizing the recursive functions (Q922528): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Walter A. Burkhard / rank | |||
Property / reviewed by | |||
Property / reviewed by: Zheng, Xizhong / rank | |||
Property / author | |||
Property / author: Walter A. Burkhard / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Zheng, Xizhong / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Hierarchy of Primitive Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5824357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4778264 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of an effectively generated class of functions by enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmented loop languages and classes of computable functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of Predictably Computable Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216621 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:42, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a complexity-based way of constructivizing the recursive functions |
scientific article |
Statements
On a complexity-based way of constructivizing the recursive functions (English)
0 references
1990
0 references
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.
0 references
constructively computable function
0 references
constructivization of recursive functions
0 references
hierarchies
0 references