Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Marat M. Arslanov"'
Publikováno v:
Russian Mathematics. 65:63-69
We examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2^0$ Turing degrees. We study the long-standing problem raised in [1] about the existence of a low computably enumerable (c.e.) degree $\bf a$ for which the
Publikováno v:
Open Engineering, Vol 7, Iss 1, Pp 403-406 (2017)
We consider the problem of packing the maximal number of unit squares in a hypograph of a function. A polynomial time algorithm is described to solve this problem for a piecewise linear function.
Publikováno v:
Pattern Recognition Letters. 100:124-130
The use of Convolutional Neural Networks (CNNs) in image analysis and recognition paved the way for long-term visual place recognition. The transferable power of generic descriptors extracted at different layers of off-the-shelf CNNs has been success
Autor:
Marat M. Arslanov
Publikováno v:
complexity, logic, and recursion theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ce440e5a5bddc31cc74546a7805645a
https://doi.org/10.1201/9780429187490-2
https://doi.org/10.1201/9780429187490-2
Publikováno v:
Logic Colloquium '98: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76dfa90b972cb421c786faeecce66bc4
https://doi.org/10.1017/9781316756140.006
https://doi.org/10.1017/9781316756140.006
Autor:
Marat M. Arslanov
Publikováno v:
Russian Mathematics. 58:64-67
In this paper we investigate questions about the definability of classes of n-computably enumerable (c. e.) sets and degrees in the Ershov difference hierarchy. It is proved that the class of all c. e. sets is definable under the set inclusion ⊆ in
Autor:
Marat M. Arslanov
Publikováno v:
SCOPUS09601295-2016-SID84975270335
Copyright © Cambridge University Press 2016In this paper, we investigate splitting and non-splitting properties in the Ershov difference hierarchy, in which area major contributions have been made by Barry Cooper with his students and colleagues. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afd3e86a26c0176bd0c4d9eaaeea06af
https://openrepository.ru/article?id=211965
https://openrepository.ru/article?id=211965
Autor:
Marat M. Arslanov
Publikováno v:
Journal of Logic and Computation. 22:669-677
In this article, we investigate model-theoretic properties of various Turing degree structures in the hierarchy of Δ02-sets which is well known in the literature as Ershov Hierarchy. In particular, questions of definability of m-c.e. degrees in the
Publikováno v:
Annals of Pure and Applied Logic. 156:13-20
In this paper we study structural properties of n-c. e. Q -degrees. Two theorems contain results on the distribution of incomparable Q -degrees. In another theorem we prove that every incomplete Π 2 0 Q -degree forms a minimal pair in the c. e. degr
Publikováno v:
MLQ. 50:628-636
We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)