Browsing by Subject "reducibility"

Sort by: Order: Results:

  • Fixed-point Selection Functions 
    Arslanov M.M. (2021)
    Abstract: Let $$\simeq$$ be a binary relation between sets of integers, and ≤R be a Post reducibility, i.e. a reflexive and transitive relation between sets of integers such that if A ≤R B then the computational complexity ...
  • Precomplete Numberings 
    Selivanov V.L. (2021)
    In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important ...
  • Turing and enumeration jumps in the Ershov hierarchy 
    Faizrahmanov M.; Kalimullin I. (2012)
    In the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov hierarchy. © 2010 The Author. Published by Oxford University Press. All rights reserved.
  • О ПРЕОБРАЗОВАНИЯХ ЛЯПУНОВА 
    Якупов Зуфар Ясавеевич (2017)
    Группы преобразований являются реальными объектами окружающего мира, о при- сутствии и о физической структуре которых можно судить по их влиянию на наши представления. К ним относятся, например, представления об однородности ...

Search DSpace

Browse

My Account