Recursion theorems and effective domains (Q1102949)
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: Publication:1102949 |
scientific article; zbMATH DE number 4051600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursion theorems and effective domains |
scientific article; zbMATH DE number 4051600 |
Statements
Recursion theorems and effective domains (English)
0 references
1988
0 references
It is observed that generalizations of the first and the second recursion theorems hold true on effective domains. Similar to the situation in classical recursive function theory [see \textit{H. Rogers} jun., Theory of recursive functions and effective computability (1967; Zbl 0183.014), pp. 196-199] it is proved that the second recursion theorem is strictly more general than the first one. The proofs are based on the numeration theory of Ershov and Mal'tsev.
0 references
recursion theorems
0 references
effective domains
0 references
numeration
0 references
0.7316429018974304
0 references
0.7174900770187378
0 references
0.7126035094261169
0 references
