
doi: 10.1007/bf01139926
Rogers has introduced the concept of stable enumeration and has proved that every precomplete enumeration is stable. Ershov strengthened this result by showing that a precomplete enumeration is strongly stable. In the present paper one constructs, in an elegant way, a class of strongly stable enumerations.
precomplete enumeration, strongly stable enumerations, Theory of numerations, effectively presented structures
precomplete enumeration, strongly stable enumerations, Theory of numerations, effectively presented structures
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
