Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy belonging to a fixed level of the Ershov
hierarchy, and we deduce existence of a Σcomputable numbering
Decomposability of low 2-computably enumerable degrees and turing jumps in the ershov hierarchy degrees whose jumps belong to the corresponding Δ-level of the Ershov
hierarchy. © Allerton Press, Inc
Very narrow quantum OBDDs and width hierarchies for classical OBDDs present new
hierarchies on widths of deterministic and nondeterministic OBDDs.
Classifying equivalence relations in the Ershov hierarchy-degrees to the Δ20 case. In doing so, we rely on the Ershov
hierarchy. For any notation a for a non-zero computable
Country’s National Interests: the Essence and Hierarchy in Contexts of Dependencies interdependence of countries the definition of national interests of the country, forming a
hierarchy Reordering method and hierarchies for quantum and classical ordered binary decision diagrams linear. Using this result we prove the width
hierarchy for complexity classes of Boolean functions
Крытэрыі вылучэння класаў афарыстычных адзінак (на матэрыяле беларускай, рускай, польскай моў) of aphoristic units are of the nature of opposition,
hierarchy and functional dynamics, which reveals
The use of hierarchy analysis in the diffusion of organization innovations considered the use of the
hierarchy analysis method (Saaty method) during the selection of possible
The enumeration spectrum hierarchy of α-families and lowα degrees© J.UCS.In this paper we introduce a
hierarchy of families which can be derived from the integers