Document Zbl 0990.94021

from until

One-Line Search

add line

Document Type:

Journal Articles

Collection Articles

Books

arXiv Preprints

Document Type:

Journal Articles

Collection Articles

Books

arXiv Preprints

Reset all

New Multi-Line Search

Help

Examples

Geometry Search for the term Geometry in any field. Queries are case-independent.

Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.

"Topological group" Phrases (multi-words) should be set in "straight quotation marks".

au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.

Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.

Quasi* map* py: 1989 The resulting documents have publication year 1989.

so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.

"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.

dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.

py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).

la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Fields

any	anywhere
an	internal document identifier
au	author, editor
ai	internal author identifier
ti	title
la	language
so	source
ab	review, abstract
py	publication year
rv	reviewer
cc	MSC code
ut	uncontrolled term
dt	document type (j: journal article; b: book; a: book article)

Operators

a & b	logic and
a \| b	logic or
!ab	logic not
abc*	right wildcard
"ab c"	phrase
(ab c)	parentheses

Sequences of binary strings with relation of conditional simplicity. (English. Russian original) Zbl 0990.94021

Mosc. Univ. Math. Bull. 55, No. 5, 20-22 (2000); translation from Vestn. Mosk. Univ., Ser. I 2000, No. 5, 19-22 (2000).

The author considers a finite analogue of the Turing degrees of unsolvability [J. Shenfield, “Degrees of unsolvability”, Nauka, Moscow (1977)] and determines a partial order formalizing the intuitive relation “\(x\) is simple with respect to \(y\)”. It is shown that the partially ordered set defined in this way is an upper semi-lattice, rather than a lattice.

Reviewer: R. K. Azimov (Andizhan)

MSC:

94A55	Shift register sequences and sequences over finite alphabets in information and communication theory
06A12	Semilattices
94A15	Information theory (general)

Keywords:

analogue of Turing degrees of unsolvability; sequence of binary strings

Cite Review PDF