No label defined (Q3334977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3868601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3868601 |
Statements
1982
0 references
algorithmic completeness
0 references
completeness problem
0 references
systems of algorithmic algebras of graph-schemes of algorithms with memory
0 references
maximal subalgebras of precomplete classes
0 references
0.7653207778930664
0 references
The investigation of algorithmic completeness is very actual in connection with the development of new programming languages and their realization. In this case completeness criteria are of particular interest for the corresponding algebraic system providing the generation of all its elements from some subset. This paper deals with the completeness problem in systems of algorithmic algebras of graph-schemes of algorithms with memory [\textit{I. D. Zaslavskij}, Tr. Mat. Inst. Steklova 72, 99-192 (1964; Zbl 0199.038)]. The completeness criteria are formulated in terms of maximal subalgebras of precomplete classes in the corresponding algebras. The author [Algorithms and Automata, Collect. Sci. Works, Kazan 1978; 11-53 (1978; Zbl 0411.68035)] investigated a family of maximal subalgebras preserving equivalence relations and binary relations of symmetry and reflexivity. The principle result of the given paper is the description of the families of maximal subalgebras preserving finitary and infinitary relations. The continuability of the family of maximal subalgebras is proved preserving infinitary and n-ary relations for \(n\geq 2\).
0 references