Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, Number 12, Pages 96–100 (Mi ivm9190)  
This article is cited in 2 scientific papers (total in 2 papers)

Brief communications

Universal computable enumerations of finite classes of families of total functions

M. Kh. Faizrakhmanov

Kazan (Volga Region) Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia
Full-text PDF (176 kB) Citations (2)
References:
PDF
HTML
Abstract: In the paper we introduce the notion of a computable enumeration of a class of families. We prove a criteria for the existence of uiversal computable enumerations of finite classes of computable families of total functions. In particular, we show that there is a finite computable class of families of total functions without universal computable enumerations.
Keywords: computable enumeration, universal enumeration, class of families, arithmetical enumeration.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 1.2045.2014
Russian Foundation for Basic Research 15-31-20607
Presented by the member of Editorial Board: N. K. Zamov
Received: 28.04.2016
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2016, Volume 60, Issue 12, Pages 79–83
DOI: https://doi.org/10.3103/S1066369X16120112
Bibliographic databases:
Document Type: Article
UDC: 510.54+510.57
Language: Russian
Citation: M. Kh. Faizrakhmanov, “Universal computable enumerations of finite classes of families of total functions”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 12, 96–100; Russian Math. (Iz. VUZ), 60:12 (2016), 79–83
Citation in format AMSBIB
\Bibitem{Fai16}
\by M.~Kh.~Faizrakhmanov
\paper Universal computable enumerations of finite classes of families of total functions
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2016
\issue 12
\pages 96--100
\mathnet{http://mi.mathnet.ru/ivm9190}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2016
\vol 60
\issue 12
\pages 79--83
\crossref{https://doi.org/10.3103/S1066369X16120112}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000409309100011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84997496769}
Linking options:
  • https://www.mathnet.ru/eng/ivm9190
  • https://www.mathnet.ru/eng/ivm/y2016/i12/p96
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:204
    Full-text PDF :51
    References:45
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024