A Family with a Single Minimal but Not Least Numbering
-
Published:2024-03
Issue:2
Volume:65
Page:381-391
-
ISSN:0037-4466
-
Container-title:Siberian Mathematical Journal
-
language:en
-
Short-container-title:Sib Math J
Publisher
Pleiades Publishing Ltd
Reference27 articles.
1. Badaev S.A. and Goncharov S.S., “On computable minimal enumerations,” in: Algebra. Proc. 3rd Int. Conf. Algebra. (in memory of M.I. Kargopolov), De Gruyter, Berlin and New York (1995), 21–33.
2. Badaev S.A. and Goncharov S.S., “Theory of numberings,” in: Open Problems in Computability Theory and Its Applications, Amer. Math. Soc., Providence (2000), 23–38 (Contemp. Math.; vol. 257).
3. Marchenkov S.S., “The computable enumerations of families of general recursive functions,” Algebra Logic, vol. 11, no. 5, 326–336 (1972).
4. Goncharov S.S., “Computable single-valued numerations,” Algebra Logic, vol. 19, no. 5, 325–356 (1980).
5. Goncharov S.S., “Positive computable numberings,” Russ. Acad. Sci. Dokl., vol. 48, no. 2, 268–270 (1994).