Impossibility of finite generation of partial recursive functions by a unary isotone operation (Q1101443): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01158258 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024436138 / rank | |||
Normal rank | |||
Latest revision as of 11:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Impossibility of finite generation of partial recursive functions by a unary isotone operation |
scientific article |
Statements
Impossibility of finite generation of partial recursive functions by a unary isotone operation (English)
0 references
1987
0 references
Let A denote the set of unary partial recursive functions. It is known that there exist two elements of A which generate, via composition, all of A, and that one element will not suffice. This paper exhibits an effective binary operation on A such that a single element suffices to generate A via that operation. On the other hand, this paper also shows that for any effective unary operation on A, no finite subset of a can suffice as a generating set.
0 references
effective operations
0 references
partial recursive functions
0 references
