|
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
Citation:
V. D. Ilyin, “Theory of S-Symbols: The classes of basic S-problems”, Sistemy i Sredstva Inform., 33:4 (2023), 139–148
Linking options:
https://www.mathnet.ru/eng/ssi918 https://www.mathnet.ru/eng/ssi/v33/i4/p139
|
Statistics & downloads: |
Abstract page: | 47 | Full-text PDF : | 17 | References: | 5 |
|