RUS  ENG
Full version
JOURNALS // Sistemy i Sredstva Informatiki [Systems and Means of Informatics] // Archive

Sistemy i Sredstva Inform., 2023 Volume 33, Issue 4, Pages 139–148 (Mi ssi918)

This article is cited in 2 papers

Theory of S-Symbols: The classes of basic S-problems

V. D. Ilyin

Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119133, Russian Federation

Abstract: The theory of S-symbols is an extended generalization of the theory of S-modeling. It is considered as a part of the methodological support for the development of artificial intelligence systems in the S-environment (including knowledge systems, systems of S-modeling of problems and program design, etc.). The S-environment based on interconnected systems of S-(symbols, codes, signals) serves as the infrastructural basis for the implementation of information technologies for various purposes. The article presents the fourth part (out of four) of the theory. The substantiation of the classes of basic S-problems is given and the main classes are defined: S-(representations, transformations, recognition, interpretation, construction, exchange, preservation, accumulation, search, information protection and cryptography). The S-problems to which other S-problems are reduced are called basic S-problem. The key S-problems of each class are considered.

Keywords: theory of S-symbols, S-problem, classes of basic S-problems, S-(representations, transformations, recognition, interpretation, construction, exchange, preservation, accumulation, search, information protection and cryptography).

Received: 07.08.2023

DOI: 10.14357/08696527230413



© Steklov Math. Inst. of RAS, 2025