An easy priority-free proof of a theorem of Friedberg (Q913786)
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:913786 |
scientific article; zbMATH DE number 4148068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An easy priority-free proof of a theorem of Friedberg |
scientific article; zbMATH DE number 4148068 |
Statements
An easy priority-free proof of a theorem of Friedberg (English)
0 references
1990
0 references
Using the priority method, \textit{R. M. Friedberg} [J. Symb. Logic 23, 309- 316 (1959; Zbl 0088.016)] proved that the class of all partial recursive unary functions can be enumerated without repetition. We present a new, straightforward proof of this result. The proof can be adapted for a wide variety of other r.e. classes.
0 references
recursively enumerable classes
0 references
partial recursive functions
0 references
numberings
0 references
0 references
0 references
0 references
0.7307820916175842
0 references
