General iteration and unary functions (Q1182467)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: General iteration and unary functions |
scientific article; zbMATH DE number 31338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General iteration and unary functions |
scientific article; zbMATH DE number 31338 |
Statements
General iteration and unary functions (English)
0 references
28 June 1992
0 references
The paper provides a programming-oriented characterization of the class of partial recursive functions. Basically, it is shown that all p.r. functions can be obtained starting with the successor and excess-over-a- square functions by using addition, composition and a while-do iteration operator. Variants of this result, obtained by changing the arity types of functions or by substituting some of the basic operators are also proved. As a by-product, Kleene's normal form theorem is derived in a more precise and programming-oriented setting.
0 references
general computable function
0 references
partial recursive functions
0 references
while-do iteration operator
0 references
0.8354451656341553
0 references
0.7933726906776428
0 references
0.7882936596870422
0 references
