RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2011 Volume 23, Issue 1, Pages 72–83 (Mi dm1131)

A case of insolubility of the problem of equivalence of programs

V. L. Shcherbina


Abstract: We consider algebraic models of sequential programs where the semantics of operators is defined on the base of a semigroup. In the paper, for the first time an example is constructed of a solvable semigroup with indecomposable neutral element for which the stopping problem for a Turing machine reduces to the problem of equivalence of programs over a given semigroup. All known examples of models of insoluble problem of equivalence of programs were based on groups. Thus, in the paper we succeeded in refining the boundary between soluble and insoluble cases of the problem of equivalence of programs in algebraic models. The obtained result supports also the importance of some sufficient conditions of solubility of the problem of equivalence of programs.

UDC: 519.7

Received: 21.01.2009

DOI: 10.4213/dm1131


 English version:
Discrete Mathematics and Applications, 2011, 21:1, 131–144

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024