Program Operators Sit Ts S1e Set1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

ISSN: 2994-6433

Research Article Journal of Sensor Networks and Data Communications


Program Operators SIT, tS,Research
Article type: S1e,Article
Set1
Journal name: Journal of Sensor Networks and Data Communications
Illia Danilishyn*, Oleksandr Danilishyn
Rec date: 2023, Sep 08 Accept date: 2023, Oct 09 Publication date: 2023, Oct 11

Sumy State University, Vulytsya Mykoly


Program Sumtsova, 2, Sumy,
Operators SIT, tS, S1e, SetCorresponding
*
1 author:
Sumy Oblast, 40000, Ukraine Illia Danilishyn, Sumy State University, Vulytsya Mykoly Sumtsova, 2, Sumy,
Illia Danilishyn*, Oleksandr Danilishyn
Sumy Oblast, 40000, Ukraine.
Communications
Publication date: 2023, Oct 11 Afiliations:
Submitted: 2023, Sep 17; Accepted:2023, Oct 21 : Published: 2023, Oct 26
Sumy State University, Vulytsya Mykoly Sumtsova, 2, Sumy, Sumy Oblast, 40000, Ukraine

Citation: Danilishyn, I., Danilishyn, O. (2023).


*Corresponding Program
Author: Illia Operators
Danilishyn, SIT,
SumytS, S1e,
State Set1. J Sen
University, Net Data
Vulytsya Comm,
Mykoly 3(1), 138-143.
Sumtsova,
2, Sumy, Sumy Oblast, 40000, Ukraine.
Abstract
Citations: Danilishyn, I., Danilishyn, O. (2023). Program Operators SIT, tS, S1e, Set1. J Sen Net
The purpose
umtsova, 2, Sumy, Sumy of theUkraine
Oblast, 40000, article Data
is to Comm,
create3(1),
new81-continue
program operators for a fundamentally new type of neural network with
parallel computing, and not with the usual parallel computing through sequential computing.
, Sumy State University, Vulytsya Mykoly Sumtsova, Abstract
The purpose of the article is to create new program operators for a fundamentally new type of
Keywords: Sit-program operators,neural tS-program
networkoperators, S1ecomputing,
with parallel - programand
operators,
not withSet
the1-usual
program operators.
parallel computing through
023). Program Operators SIT, tS, S1e, Set1. J Sen Net
sequential computing.
1. Introduction 2.1 Here are Some of the Sit-Program Operators
Keywords: Sit-Program Operators, tS-Program Operators, S1e - Program Operators, Set1-
Here it is supposed to use a symbiosis Program Operators.
of parallel actions and • Simultaneous assignment of the expressions {p}=(p1,p2 ,...,pn)
w program conventional
operators for acalculations
fundamentallythrough
new typesequential
of actions.2.1 Here This must are Some be of the to Sit-Program
the variables {а}=(а Operators ,а ,...,аn). Implemented through
1 2
and not withdonethethrough
usual parallel computing
Sit-Networks [1]through
in one of the central
1. Introduction  Simultaneous
departments assignment of the expression𝑠𝑠 �𝑝𝑝� � �𝑝𝑝� , 𝑝𝑝� , . . . , 𝑝𝑝� � to the variables �а�
Here it2.1 isisHere
supposed toThe useofparallel
а�a, .the
symbiosis of parallel actions and conventional ��а�≔����calculations
of which a conventional computer system located.are Some
. . ,Sit-Program Operators
, or 𝑆𝑆𝑆𝑆��� through
�а�≔
�а � ,must а� �. Implemented through 𝑆𝑆𝑆𝑆х .
processor sequential  actions.
Simultaneous This assignment be done of through
the Sit-Networks
expression𝑠𝑠 �𝑝𝑝� [1]
� in
�𝑝𝑝 ,one
𝑝𝑝 , .of
. . ,the
𝑝𝑝 �central
to the departments
variables �а� �
S1eis -itself eprogram [1] with direct parallel computing not � � �
rogram Operators, Program Operators, Setof1- which a conventional
�а� , а�, . . . Simultaneous check
computer system is thelocated. set of The
��а�≔���� conditions
parallel �а�≔ �𝑓𝑓�
processor�is �𝑓𝑓 � , 𝑓𝑓�,
itself . . . , 𝑓𝑓� �[1]
eprogram for a set of expressions�𝐵𝐵�
through serial computing. with are direct parallel
, а� �. Implemented
computing not through •through Simultaneous
serial
𝑆𝑆𝑆𝑆 х
computing.
, orcheck
𝑆𝑆𝑆𝑆��� .the set of conditions
2.1����������
Here are Some of the
{f} = (f1,f2Operators , ...,fn ) for
2.1 Here Some of the Sit-Program Operators ���� � Sit-Program
 Simultaneous �𝐵𝐵 � , 𝐵𝐵
check �, . .
the . , 𝐵𝐵
set � �.
of It is
a
conditions
 Simultaneous assignment of the expression𝑠𝑠 �𝑝𝑝� � �𝑝𝑝� , 𝑝𝑝� , . . . , 𝑝𝑝� � to the variables �а� � implemented
set of
�𝑓𝑓� expressions{B}
� �𝑓𝑓 � , through
𝑓𝑓 �, . . . , 𝑓𝑓 � � 𝑆𝑆𝑆𝑆
for=
 (B
a set ,B of
Simultaneous
х 1 2, ...,B
expressions�𝐵𝐵�
assignment
n
). where
It of is the� Q can
implemented
expression𝑠𝑠 be�𝑝𝑝�any. � �𝑝𝑝� , 𝑝𝑝� , . . . , 𝑝𝑝�
��а�≔����
Using conventional coding by a�а computer system, through through where �Q, а� ,can , а�be any.
�а�≔
Using conventional
�𝐵𝐵 , 
𝐵𝐵
, а , . . . , а� �. Implemented
� �, . .Similarly
coding
. , 𝐵𝐵 �. by
It
�through 𝑆𝑆𝑆𝑆хis for
aimplementedloop
computer
��а�≔����
operators
system,
through
�а�≔
, or 𝑆𝑆𝑆𝑆��� . and
through
𝑆𝑆𝑆𝑆х others.
���������� ���� �
a Target-block where with
�а
Q a
. . . Sit
can be �.-program
any.Implemented through 𝑆𝑆𝑆𝑆х , or 𝑆𝑆𝑆𝑆��� .
parallel actions and conventional calculations through� � ����  Simultaneous check the set of conditions �𝑓𝑓� � �𝑓𝑓� , 𝑓𝑓�, . . . , 𝑓𝑓� � for
a Target-block with a Sit -program  operator
operator
Simultaneous  - Similarly
𝑆𝑆𝑆𝑆
check forofloop
the set it will
, conditions
it willoperatorsbe�𝑓𝑓� possible
�and•�𝑓𝑓�others.
to�,Similarly
, 𝑓𝑓 .obtain
. . , 𝑓𝑓� � for theafor ofloop
execution
set operators
expressions�𝐵𝐵�of a parallel � and others.
action A with the
gh Sit-Networks [1] in one of the central departments ����������
�𝐵𝐵� , 𝐵𝐵�, . . . , 𝐵𝐵� �. It is implemented through 𝑆𝑆𝑆𝑆х
���������� ���� �
where
be possible to obtain the execution
s located. The parallel processor is itself eprogram [1] of
desired
�𝐵𝐵� , a
𝐵𝐵�,parallel
. target
. . , 𝐵𝐵 � �. It2.2
action
weight
is Sit-Algorithm
f. A
implemented Eachwith code
throughthe for 𝑆𝑆𝑆𝑆Examples
х
a neural
���������� ���� �
network where from
Q can a
be conventional
any. computer we "bind"
 Similarly for loop operators and others.
desired target weight f. Each code
serial computing. for a2.2
(match)
 Similarly to
for Sit-Algorithm
neural the corresponding
loop
 network
operators andExamples
Simultaneous from
others.valueaof current 2.2��∗�
multiplication:
(or voltage).��∗�
Sit-Algorithm For Sit-coding and Sit-translation may
𝑆𝑆𝑆𝑆х Examples
: enter the notation of Examples
thelaser set B with elements 𝑏𝑏���� ...��
be usealternating Simultaneous current of ultrahigh
multiplication: frequency
𝑆𝑆𝑆𝑆 : enter or high-intensity
the notation ofultra-short
the set2.2 optical
B Sit-Algorithm
with elements pulses
conventional computer we "bind" (match)
2.2 Sit-Algorithm
of Nobel laureates toExamples
the corresponding
2018 ��year Gerard
∗,� • х � Simultaneous
Mourou,
∗,...,� Donna Strickland,multiplication:
or a combination Stх{a*}
 Simultaneous of enter𝑏𝑏For
: multiplication:
them.
��the �
�� ...��notation
��∗�
𝑆𝑆𝑆𝑆х : enter the ofnotation
the of the set B
� � �
system, through a Target-block with a
value of current (or voltage). For Sit -program Sit-coding
 Simultaneous
���� ∗,��� ∗,...,���∗�
and � Sit-translation
multiplication: �𝑆𝑆𝑆𝑆 ����� ��
� 𝑆𝑆𝑆𝑆х �: enter the notation�
��
setof B
for
the with
set any
B elements
with�𝑖𝑖 , 𝑖𝑖
elements , . . .𝑏𝑏, 𝑖𝑖 � without
� �� ∗,�
repetitions,
∗,...,� �
for any
x � {i ,i ,...,i } repetitions,
the desired�𝑆𝑆𝑆𝑆 action,
� for example, � �� using for any �𝑖𝑖� , 𝑖𝑖�� , . .parallel
the direct �
. , 𝑖𝑖� without � �repetitions,
program of �operator
� �� ...�
� � x�𝑆𝑆𝑆𝑆�
𝑆𝑆𝑆𝑆
���� ��
� ���������� ��
��

�����

��
, we

for any �𝑖𝑖� , 𝑖𝑖� , . .1. , 𝑖𝑖2� � without
n
to obtain the
mayexecution
be useofalternating
a parallel action A withoftheultrahigh
current frequency
�� �
���� ∗,��� ∗,...,����������������
or high-
��������������� ������ without
� �,...,�� � repetitions, ��� �,�� �,...,�x= � St {multiplication ,
table} ������
Q ,using R=, 𝑆𝑆𝑆𝑆 Raor isanhigh-intensity
the index of(we thechoose lower dischargeindex (weof cho
������ ��� �,� ��������������� �� �,� �,...,� �
simultaneously
�𝑆𝑆𝑆𝑆�
ural network from a conventional computer we "bind" ���������������

𝑆𝑆𝑆𝑆� enter
� �
�� for 𝑆𝑆𝑆𝑆the� desired
any ,. , R=
�𝑖𝑖� , 𝑖𝑖� , . . set 𝑖𝑖�of codes
𝑆𝑆𝑆𝑆
� without� repetitions, aRxmicrowave
is
�� the indexcurrent of ,the
� lower
𝑆𝑆𝑆𝑆� discharge
index on the scale of discharges):
,
ultra- R= 𝑆𝑆𝑆𝑆�
� � �
, R is the the lo
intensity ultra-short optical pulses 𝑆𝑆𝑆𝑆 laser
short of
optical Nobel
an ������ laureates
index
pulses on
, laser the
an index
R= 𝑆𝑆𝑆𝑆 scale
in 2018
of
Target-block. discharges): R=
on the scale ofa discharges):
��� �,�� �,...,�� �
, R is the St
index 1
of 2
{i +,i +,...,i }
the lower
n , R
dischargeis the (we index
choose of the lower discharge (we choose
nt (or voltage). For Sit-coding and Sit-translation may � �
year Gerard
uency or high-intensity Mourou,
ultra-short Donna
optical pulsesStrickland,
an index on the
laser orscale a combination
of discharges): of an index on the scale of discharges):
In a conventional using thecomputer, the process of sequential calculation takes a certain time interval, in a index discharge
ou, Donnathem. For the
Strickland, or adesired action,
combination for example,
of them. For direct parallel n n
���� �� ��� directly parallel calculation by a neural index discharge
network, the calculation is instantaneous, but it occupies a …
program
direct parallel program of of
operator
operator 𝑆𝑆𝑆𝑆���������� , we we simultaneously enter
index the discharge
nindex discharge

certain region of the space n of calculation n n objects. index discharge 1 1
s Q using adesired set of
microwave codes
current or Q using a microwave
high-intensity ultra- current or high-intensity … … … … n n , 0
n n -1 1st digit to the
ultra-short optical pulses laser in Target-block.2. Consider the Types of 1 Direct Parallel 1 1 Program Operators 1… … right of the point
 Sit-program operators , 0 , … 01 … -2 2nd digit to the
sequential calculation takes a certain time interval, ina tS-program operators -1 1st digit to the 1 right of the point
In a conventional
work, the calculation computer,
is instantaneous, the process
but it occupies a of sequential calculationright-1of the point 11st ,
digit to the 1 0 ... ...
 S e - program operators
1
-2 right of the point
bjects. takes a certain time interval, in a directly parallel calculation by a2nd digit to the
right-2of the point , 2nd -1 digit to the 0 1st digit to the
 Set1- program operators
neural network, the calculation is instantaneous, but it occupies ... a... right of the point right Thenof thegives
����
point the final result of simultaneous multiplication. Any
Program Operators -1 1st digit to𝑆𝑆𝑆𝑆хthe
chosen, right
in particular of the
binary. Here,point in fact, sets of digits in the correspo
certain region of the space of calculation objects. ... ...-2 2nd digit
numbers, to the together simultaneously. The simplest function
are multiplied
-2 2nd digit to the right of the
Then 𝑆𝑆𝑆𝑆х
����
gives the final result of simultaneous multiplication. Any system of calculus can right be of the point
arithmetic-logical device for Sit-multiplication:

2. Consider the Types of Directchosen, Parallel Program binary. Operators point


in particular
numbers, areThen
����
Here, in fact, sets of digits in the corresponding ... digits, representing ...
multiplied givessimultaneously.
𝑆𝑆𝑆𝑆х together the final result Theof simultaneous
simplest functionalmultiplication.
... scheme of the ...assumed Any system of calculus canof be
• Sit-program operators arithmetic-logical device for Sit-multiplication:
Register entering a set of numbers to m
chosen, in particular binary. Here, in fact, sets of digits in the corresponding digits, representing
• tS-program operators numbers, are multiplied together simultaneously. The simplest functional scheme of the assumed
• S1e - program operators arithmetic-logical Then 𝑆𝑆𝑆𝑆ofdevice
���� for Sit-multiplication:
gives Then Stхresult
{B+}
gives the final result of simultaneous multiplication.
Register х entering a setthe final
of numbers of simultaneous
to multiply multiplication. Sit-block Any system ofmultiplication
of simultaneous calculus can in a
• Set1- program operators Any system
chosen, in particular binary. Here, in fact, sets of digits in the corresponding of calculus can be chosen, in particular binary.digits, Here,represent
in fact, sets of digits in the corresponding of digits
digits, representing of the levels of these number
numbers, are Register multiplied of entering together a set simultaneously.
of numbers to The multiply simplest functional scheme of the assum
J Sen Net Data Comm, 2023 arithmetic-logical
Sit-block of simultaneous multiplication in all chains device for Sit-multiplication: Volume 3 | Issue 1 | 138
of digits of the levels of these numbers Sit-block of simultaneous addition of the v
of these products
Register ofmultiplication
Sit-block of simultaneous entering a set ofchains
in all numbers to multiply
of digits
Sit-block of simultaneous of the
addition levels
of the of these
values numbers
... ...

����
Then 𝑆𝑆𝑆𝑆х gives the final result of simultaneous multiplication. Any system of calculus can be
chosen, in particular binary. Here, in fact, sets of digits in the corresponding digits, representing
numbers, numbers,
are multiplied together simultaneously.
are multiplied The simplestTheSit-multiplication:
together simultaneously. simplest functional scheme of the assumed
functionalarithmetic-logical
scheme of the assumed arithmetic-logical device
device for Sit-multiplication: for

Register of entering a set of numbers to multiply

Sit-block of simultaneous multiplication in all chains


of digits of the levels of these numbers

Sit-block of simultaneous addition of the values


of these products

Register of saving the final result


����� ������� �
���� ����� ������� ��� � ���� ���� �� �
One example is pattern recognition: 𝑆𝑆𝑆𝑆�����
�����


����� �������
�����

���� ���� �� �
���� ���� ���� �� �
.

One example is pattern recognition: 𝑆𝑆𝑆𝑆����������� �������
���� ���� ���� �� � .
One example is pattern recognition: �����:����
𝑆𝑆𝑆𝑆� ���������� ���� � �
.
��� �����:���� ,�� ���������� ���� � ,�� � �
���х ,��х ,�� �
The example of Sit-program is 𝑆𝑆𝑆𝑆�����х��а����:����,��х���������� ���� �,����� � .
х х���������� ���� �
The example
Consider of Sit-program
a third type of capacity is 𝑆𝑆𝑆𝑆����х��а����:���� ,��х

,��� � .
� �а�
is 𝑆𝑆𝑆𝑆� in itself [1]. For example, . based on 𝑆𝑆𝑆𝑆хх�а� , where �а� �
�а�
The example of Sit-program
Consider
�а , а� , . . . a, а��third
�, i.e.type n - of capacity
elements at onein itself
point, [1].we can For consider
example,thebased on 𝑆𝑆𝑆𝑆
capacity𝑆𝑆 𝑓𝑓 in, itself
wherewith�а� m


� �
Consider a third type of capacity in itself [1]. For example, based on � х�а� , where �а� �

𝑆𝑆𝑆𝑆
�а
Consider a third type � , of
а�capacity
elements , а� �,in�аi.e.
, . . .from itself n[1].
�, m<n, - elements
which
For isatformed
example, one
basedpoint,
on Stwe
according {а}
, canto
where consider
the form:
{а}=(а ,the
а capacity𝑆𝑆
,..., а ), i.e. �n𝑓𝑓х- in itself
elements with
at one m
point, we
�а � , а� , S
elements
can consider the capacity . . .from
f ,in �,�аi.e.
а�itself � , n -melements
m<n,
with which
elements is atformed
from one{а},point,
according
m<n, we
х
whichcanto consider
isthe
formedform:
1
the2 capacity𝑆𝑆
according
n
to the 𝑓𝑓 in itself with m
�form:
elements3 from �а�, m<n, which is formed according to the form:
wmn mn=(m,(n,1)) (1)
wmn=(m,(n,1)) (1)
�а�
�а�
wmn=(m,(n,1)) (1)
thatStis,
that is, the structure {а} the structure 𝑆𝑆𝑆𝑆х
contains only m хelements. �а� contains only m elements.
that хis, the structure 𝑆𝑆𝑆𝑆х�а� contains only m elements.
that is, the structure
Capacities inthird
themselves 𝑆𝑆𝑆𝑆х contains onlytype m elements.
Capacities in themselves of the type can of be the third
formed for any can
otherbe formednot
structure, fornecessarily
any otherSit, structure,
only by not necessarily
necessarily reducing the
number of elements Capacities
Sit,inonly in themselves
by necessarily
the structure, of
reducing
in particular, the third
usingtheform number of elements in the structure, in particular, necessarily
type can be formed for any other structure, not using form
Capacities
Sit, only byinnecessarilythemselvesreducing of the third type can
the number of be formedinfor
elements theany other structure,
structure, in particular, not necessarily
using form
Sit, only by necessarily reducing
𝑤𝑤� . . . � the�� number
, �� , of. .elements
�. �� , 1�. in
. . the structure,
��� (2) in particular, using form
��� � ���

� �
� �

𝑤𝑤�� . . .�� � ��� , ��� , �. . . ��� , 1�. . . ��� (2)
Structures more complex thanmore S3f can 𝑤𝑤�� . . .�� For
be introduced. � �� � , ��� ,through
example, �. . . �� forms , 1�. . .that (2)
��� generalizes
Structures complex than S33f can be introduced.a�For example, through(1): a forms that generalizes
Structures
(1): more complex than S3f can be introduced. For example, through a forms that generalizes
Structures more complex than S3f can be �
(1): introduced.
��, ��, ��� For(3) example, through a forms that generalizes
(1): 𝑤𝑤���
���
𝑤𝑤��� � ��, ��, ��� (3)
𝑤𝑤��� � ��, ��, ��� (3)
B
B
𝑤𝑤���
���
�� B C (4)
𝑤𝑤��� �� C (4)
𝑤𝑤��� �� C (4)
A (B,C)
J Sen Net Data Comm, 2023 A (B,C) Volume 3 | Issue 1 | 139
AG (B,C)
(5)
G (5)
G Q (5)
Q
Q
B
𝑤𝑤��� � � C (4)

A (B,C)
G (5)
Q
A R Q
V (6)
S

𝑤𝑤����…��� �A��� , ���, �. . . ��� , L ��. . . ��� (8)


𝑤𝑤����…��� � q��� , �� r � , �. . .r��� ,(7) ��. . . ��� (8)
and corresponding generalizations of (8) on (4)-(7), etc.
S
and corresponding generalizations of (8) on (4)-(7), etc.
where A(3), (8) are represented
is compressed (fits) in C in thethrough
compression thestructure
usualB2-bond.
in C (i.e. in Science
the structure is the discipline
StCB); or through the ofmore
2-connections,
general forms that since
generalizes (2): 𝑤𝑤����…��� � ��� , ��� , �. . . ��� , ��. . . ��� (8)
(3), (8) are represented
everything in science isthrough carried the out usual
through 2-bond.
2-connected Sciencelogic, is thequantum
disciplinelogic of 2-connections,
is also a projection since
where A is compressed (fits) in C in the compression structure B in C (i.e. in the structure 𝑆𝑆𝑆𝑆�� ); or
everything
of 3-connected
and corresponding through
in science
generalizations is
logicofonto
the more general
carried
(8)forms
on𝑤𝑤 out
2-connected
(4)-(7), through
etc.� ���logic. 2-connected logic, quantum logic
(4)-(7) schematically interpret the formation of is also a projection
��that
�� …�generalizes , ��(2):
� , �. . . ��� , ��. . . ��� (8)
of 3-connected logic onto
capacity in itself through a pseudo 3-connected form2-connected
��
logic. (4)-(7) with schematically
a 2-connectedinterpret form. The theideology
formation of
of Sit
(3), (8) arecapacity
andrepresented
and corresponding S3f and in corresponding
can itself
be used
through
generalizations through
thefor
usual
of (8) a2-bond.
pseudo
programming.
generalizations
on 3-connected
Science
(4)-(7), etc.
is the
of (8) form
on discipline
(4)-(7), etc. with
of a 2-connected
2-connections, since form. The ideology of Sit
everything in science is carried out
and S3f can be used for programming. through 2-connected logic, quantum logic is also a projection
of(3),
3-connected logic onto 2-connected logic. (4)-(7) schematically interpret the formation of
(8) 𝑆𝑆
are𝑓𝑓– (3), (8)
represented
� itselfsoftware
areoperators
through represented through
the usual 2-bond.
[1] the
Science
will usual 2-bond.
is theonly
differ discipline Science
just of because is the discipline
2-connections, of 2-connections,
since everything
aggregates �, �𝐵𝐵�since
�а�,in�𝑝𝑝science is, �carried
𝑓𝑓� will out be
capacity in
through 2-connected through
logic, a pseudo
quantum 3-connected
logic is also form
a with
projection a 2-connected
of 3-connected form.
logic The
onto ideology of
2-connected Sit
logic. (4)-(7) schematically inter-
formed everything
software
from in science is[1]
operators
corresponding carried
willout
Sit-program through
differ only 2-connected
operators justwith
inbecause
formlogic, (1)quantum
aggregates
forform.
more logic �isаalso
complex �, �𝑝𝑝aofprojection
�operators
�𝐵𝐵and
�, �𝑓𝑓 will
� can be
Sof3f in forms
and
pretSthe
𝑆𝑆formation
3f can � 𝑓𝑓–
be used for programming. , Sit
ofof 3-connected
capacity in itself through
logic ontoa pseudo 3-connected
2-connected logic.form (4)-(7) aschematically
2-connected The
interpret ideology
the formation be
formed
used for(2)-(4). from corresponding
programming.
capacity[1] in itself through
Sit-program
a pseudo
operators
3-connected
in form
form �with
(1) for more complex operators in forms
𝑆𝑆� 𝑓𝑓– software operators will differ only just because aggregates а�, �𝑝𝑝a�,2-connected
�𝐵𝐵�, �𝑓𝑓� willform.
be The ideology of Sit
(2)-(4). and S3f can be used for programming.
formed from corresponding
S3 f – software operators [1]Sit-program
will operators in form (1) for more complex operators in forms
��� differ only just because aggregates {а},{p},{B},{f} will be formed from corresponding Sit-program
(2)-(4).
operators For example,
in form (1) for more𝑆𝑆𝑆𝑆���� is the
complex capacity
operators in formsin(2)-(4).
itself of the second type if 𝑔𝑔�𝑅𝑅� is a program capable of
For 𝑆𝑆� 𝑓𝑓– software
example, 𝑆𝑆𝑆𝑆
��� operators [1] will differ only just because aggregates �а�, �𝑝𝑝�, �𝐵𝐵�, �𝑓𝑓� will be
is the capacity in itself of the second type if 𝑔𝑔�𝑅𝑅� is a program capable of
generating formed �. ����
�𝑅𝑅from corresponding ofSit-program operators 𝑔𝑔�a𝑅𝑅in
� form (1) for more complex operators in forms
���
For
Forexample,
example, 𝑆𝑆𝑆𝑆���� thecapacity
is the capacity inin itself
itself of the the second
second type type
if g{R} if is is a program
program capable capable of {R}.
of generating
generating (2)-(4).� 𝑅𝑅 � .
generating �𝑅𝑅�. ��а����:���� ���������� ���� � �
���х ,��х ,�� �
The example of self-program
For example, is the of the
���
capacity
𝑆𝑆𝑆𝑆���� first type
in itself
�����:���� ofisthe
𝑆𝑆𝑆𝑆����
���������� second
��� � type ,��
������:���� if ����������
𝑔𝑔�𝑅𝑅� is ����
���������� a����
program


.
� capable
� ,��� of
���х ,��х ��а����:����
х,��� � х ���
The of
The example example of
self-programself-program
of the
generating �𝑅𝑅�. first type of
is the
𝑆𝑆𝑆𝑆 first type
��а����:���� is 𝑆𝑆𝑆𝑆 ��� х .
���������� ���� ������:����

,�� х
���������� ���� �
,�� �

.
���х ,��х ���х,��� � ,��х ,��� �
�����:���� ���������� ���� � �
���х ,��х ,��� �
The example of self-program
The of Sit-program for Smnst [1]:
example of Sit-program for of the first
Smnst type is 𝑆𝑆𝑆𝑆
[1]: .
The example ���х
�����:���� ���������� ���� �
,��х

,��� �
�� q to B.
��
The example
𝑆𝑆𝑆𝑆� - assigning
𝑆𝑆𝑆𝑆�
of Sit-program
- assigning q to B. for Smnst [1]:
���
-𝑆𝑆𝑆𝑆 ��
assigning target weight
𝑆𝑆𝑆𝑆� ���
𝑆𝑆𝑆𝑆�� to to
- assigning q 𝑡𝑡𝑡𝑡 B.f .
- assigning target weight 𝑡𝑡𝑡𝑡 to f .
����
The
- Smnst
��� example of
- assigning Sit-program
for weightfor𝑡𝑡𝑡𝑡
�𝑞𝑞�𝑓𝑓.
target Smnstf [1]:
for to .
𝑆𝑆𝑆𝑆����������
𝑆𝑆𝑆𝑆 ���� 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎
𝑆𝑆𝑆𝑆� �� - Smnst 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 �𝑞𝑞�𝑓𝑓.
���� 𝑆𝑆𝑆𝑆� - assigning q to B.
����������
𝑆𝑆𝑆𝑆���� - -Smnst
𝑆𝑆𝑆𝑆����������
2.3 Sit-Coding assigning target weightfor
𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 𝑡𝑡𝑡𝑡�to
𝑞𝑞�f𝑓𝑓..
Sit-coding: 1) set A
2.3 Sit-Coding to
����set B, 2) set A to a point q, where the elements of the sets A, B can be
𝑆𝑆𝑆𝑆����������� - Smnst 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 for �𝑞𝑞�𝑓𝑓.
continuous. For example, 𝑆𝑆𝑆𝑆� .
2.3 Sit-Coding
Sit-coding: 1) set A to set B, 2) set A to a point q, where the elements of the sets A, B can be
There areSit-coding: 1)
Forset
2.3 Sit-Coding
continuous.
Sit-coding, A to set
example,
Sit-translation, 𝑆𝑆𝑆𝑆B,
� . 2) set

Sit-realize A to a point
of eprograms and ofq,the where the from
programs elements
the of the sets A, B can be
archivescontinuous.Sit-coding: 1) set A to
For example, 𝑆𝑆𝑆𝑆� . �
without extraction theirs set� B, 2) set A to a point q, where the elements of the sets A, B can be
continuous.
J Sen Net Data Comm, 2023 For example, 𝑆𝑆𝑆𝑆� .
There are Sit-coding, Sit-translation, Sit-realize of eprograms and of the Volume 3 | Issue 1 | 140
programs from the
2.4 Self-Coding
There
archives
Self-coding: are toSit-coding,
Awithout
There
1) set i.e. A onSit-translation,
extraction
areA,Sit-coding,
set itself 2) set A to a Sit-realize
theirs
Sit-translation, Sit-realize
point ofof(1),
q in form eprograms
eprograms
where theand and
of theofprograms
elements the programs
from thefrom the
archives
of the sets A, B can without
archives extraction
without For
be continuous. extractiontheirs
example, theirs�
𝑆𝑆𝑆𝑆� .
2.4 Self-Coding
�� Sit-coding: 1) set A to set B, 2) set A to a point q, where the elements of the
𝑆𝑆𝑆𝑆� - assigning q to B. continuous. For example, 𝑆𝑆𝑆𝑆�� .
𝑆𝑆𝑆𝑆����
weight 𝑡𝑡𝑡𝑡 to- fassigning
. target weight 𝑡𝑡𝑡𝑡 to f .
����
for �𝑞𝑞�𝑓𝑓. - Smnst 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 for �𝑞𝑞�𝑓𝑓.
𝑆𝑆𝑆𝑆����������
𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 There are Sit-coding, Sit-translation, Sit-realize of eprograms and of the pr
archives without extraction theirs
2.3 Sit-Coding
B, Sit-coding:
2) set A to a1)point set Aq,towhereset B,the 2) set A to aofpoint
elements q, where
the sets A, B thecanelements
be of the sets A, B can be 2.4 Self-Coding
2.3 Sit-Coding
𝑆𝑆𝑆𝑆�� .continuous. For example, 𝑆𝑆𝑆𝑆�� . Self-coding: 1) set A to set A, i.e. A on itself 2) set A to a point q in form (1), w
Sit-coding: 1) set A to set B, 2) set A to a point q, where the elements of the sets A,sets
of the B can
A, Bbe
cancontinuous.
be continuous. ForForexample,
example, 𝑆𝑆𝑆𝑆�B� .
There are
-translation, There are Sit-coding,
Sit-coding,
Sit-realize of Sit-translation,
eprograms Sit-translation,
and Sit-realize
of the programsSit-realize
of from of
eprograms eprograms
and
the and of from
of the programs the programs
the from the archives without extraction theirs
n theirsarchives without extraction theirs One of the central departments of the control system should be a computer sy
type of the desired level. In symbiosis with Sit-Networks [1], it will provide a
2.4 Self-Coding
2.4 Self-Coding of the control system in three modes: conventional serial through a convention
A, Self-coding:
i.e. A on Self-coding:
itself1)2)setset
AA to1)
tosetset
a A, Ai.e.toqAset
point A,
inonform i.e.
itself 2)Awhere
(1), onAitself
set tothe 2) set
a point q inAform
elements to a (1),
point whereq inthe
form (1), where
elements system,the elements
direct of the sets
parallel through A, B canand
Sit-Networks be series-parallel.
continuous. For Codes from a
of theFor
tinuous. example,
sets A, B can𝑆𝑆𝑆𝑆be
example, � .continuous. For example, 𝑆𝑆𝑆𝑆� .
� � computer system will be used via Sit -connectors in Sit - coding, for example: 𝑆𝑆𝑆𝑆
AC field activation is used.
mentsOne ofOne
of the the central
control departments
system should of
be the
a control
computer system should
of the be a
usual computer system of the usual
of the central departments of the control system should be a computer system of the usual type of the desired level. In symbiosis with
type of the
n symbiosis desired
with level. In [1],
Sit-Networks symbiosis with Sit-Networks
it will provide [1], it will provide a holistic operation 2.5 Dynamic Sit and S3f(t) Programming
a holistic operation
hree of Sit-Networks
the control
modes: in[1],
system serial
conventional three it modes:
will provide
through a conventionala holistic operation
serialcomputer
type of the control
through a conventional type system
computerinThethree modes:
ideology conventional
of dynamic Sit and Sserial through a conventional
3f(t) can be used for programming:
oughsystem, type
directcomputer
Sit-Networks parallel system,
through
and series-parallel. direct from
Sit-Networks
Codes parallel
and through Sit-Networks
series-parallel.
a conventional Codes from aand
type series-parallel.
conventional Codes
type  The fromofa conventional
process simultaneous assignmenttype computer
of the system will�𝑝𝑝� � �𝑝𝑝� , 𝑝𝑝
expression𝑠𝑠
sed via computer be system
used via
Sit -connectors in Sit
will Sit -connectors
be -used via Sit
coding, in Sit -𝑆𝑆𝑆𝑆coding,
for-connectors
example:
���� �� ���
in Sit -
����������
for
coding,
. example:
UHFfor
example: 𝑆𝑆𝑆𝑆
���� �� ���
���������� . UHF
UHF AC field activation is used.
variables �а� � �а� , а� , . . . , а� � is implemented through 𝑆𝑆𝑆𝑆�𝑆𝑆�х
��а�:����
.
. AC field activation is used.
2.5 Dynamic Sit and S f(t) Programming
3
2.5 Dynamic Sit and S3f(t) Programming
t) Programming
The ideology
TheS3ideology
Sit and of used
f(t) can The
be dynamic
ofprogramming:
for
dynamic Sit and
Sit and S3f(t)canThe
Sprocess
be The
used
f(t)forcan ofbe used for programming:
simultaneous
programming: check the the set set
of conditions �𝑓𝑓�𝑡𝑡�� � �𝑓𝑓�𝑡𝑡�� , 𝑓𝑓�, �𝑡𝑡� . . . , 𝑓𝑓�𝑡𝑡�� �
process of simultaneous check
3
process
the set of simultaneous
ofofthe
conditions check
�𝑓𝑓�𝑡𝑡�� � �𝑓𝑓�𝑡𝑡� of𝑓𝑓�,conditions
� ,(t),p �𝑡𝑡� . . . ,. 𝑓𝑓�𝑡𝑡��𝑓𝑓�𝑡𝑡��
� � is
� �𝑓𝑓�𝑡𝑡� � , 𝑓𝑓�, �𝑡𝑡� . . . , 𝑓𝑓�𝑡𝑡�� �
The • The
The process
process
process of�𝑓𝑓�𝑡𝑡�� of
of simultaneous
simultaneous
simultaneous assignmentfor assignment
check
a set the of setof expressions
conditions
expressions�𝐵𝐵�𝑡𝑡�� �𝑓𝑓�𝑡𝑡��
� {p(t)}=
�𝐵𝐵 � (p
�𝑓𝑓�𝑡𝑡�
�𝑡𝑡�, 𝐵𝐵 ,
�𝑡𝑡�,𝑓𝑓 . (t),...,p
�𝑡𝑡�
. . , 𝐵𝐵 . . ,
�𝑡𝑡�� (t))
𝑓𝑓�𝑡𝑡� to
� the variables
implemented {а(t)}=(а
through (t),а2 (t),...,аn (t))
taneous
he  of
set assignment
conditions the expression𝑠𝑠
� �𝑓𝑓�𝑡𝑡� �𝑝𝑝� ��𝑡𝑡�
� , 𝑓𝑓�, �.,of
�𝑝𝑝for .𝑝𝑝.�,,athe , expression𝑠𝑠
. . .set
𝑓𝑓�𝑡𝑡� 𝑝𝑝����ofto expressions�𝐵𝐵�𝑡𝑡��
the �𝑝𝑝� � �𝑝𝑝� , 𝑝𝑝� , . . .� � to�𝑡𝑡�,
, 𝑝𝑝���𝐵𝐵 the𝐵𝐵
1� � �𝑡𝑡�,
�,
2
. . �. , 𝐵𝐵n �𝑡𝑡��� is implemented through 1
is�а� for a set of expressions�𝐵𝐵�𝑡𝑡�� � �𝐵𝐵 �𝑡𝑡�, 𝐵𝐵 �𝑡𝑡�, . . . , 𝐵𝐵 �𝑡𝑡�� is implemented through
. implemented through
��а�:����St(t)
{{а(t)}:{p(t)}} � � �
,eous check
. . , �а�𝑡𝑡�,
. �𝐵𝐵  for
the set
The
� �𝑡𝑡�,The
is𝐵𝐵implemented
� �variables ,aof
. .� set
process
process
𝐵𝐵 ofof
conditions
� , а� , .of
�𝑡𝑡��
�through
�а expressions�𝐵𝐵�𝑡𝑡��
�𝑓𝑓�𝑡𝑡��
аsimultaneous
simultaneous
. ,is
. 𝑆𝑆𝑆𝑆�𝑆𝑆� � �𝑓𝑓�𝑡𝑡�
�implemented
хis implemented
check
����. 𝑆𝑆𝑡𝑡�𝑡𝑡�

����������������
хcheck the
х through
�through
� .�𝑡𝑡�,
�𝐵𝐵
,����������������
𝑓𝑓the
�, �𝑡𝑡�
set
The
set of
�𝑆𝑆𝑆𝑆�𝑆𝑆� 𝐵𝐵
. ,����
.process
of 𝑓𝑓�𝑡𝑡��𝑡𝑡�,
���а�:����
����
conditions
�����
� . . . ,��𝑓𝑓�𝑡𝑡��
of� ����
conditions .where 𝐵𝐵
simultaneous
�𝑓𝑓�𝑡𝑡��
�Q(t) � is
�𝑡𝑡�� check implemented
bethe
� �𝑓𝑓�𝑡𝑡�
can �𝑓𝑓�𝑡𝑡�
any.set
,,𝑓𝑓𝑓𝑓�,of conditions
�𝑡𝑡�
�,�𝑡𝑡�
through
�𝑓𝑓�𝑡𝑡��
......,,𝑓𝑓�𝑡𝑡�
𝑓𝑓�𝑡𝑡�
����
� �𝑓𝑓�𝑡𝑡�� , 𝑓𝑓�, �𝑡𝑡� . . . , 𝑓𝑓�𝑡𝑡�� �
ons�𝐵𝐵�𝑡𝑡��• � �𝐵𝐵 The
����������������
𝑆𝑆𝑡𝑡�𝑡𝑡� process
�����
���������������� 𝑆𝑆𝑡𝑡�𝑡𝑡�
of ,simultaneous
����
х 
���� where
The
where
is Q(t) can
check be�� any.
process
Q(t)
implemented х� can the of
for�𝑡𝑡�, set
be simultaneous
a any. of
set
through conditions
of .expressions�𝐵𝐵�𝑡𝑡�� check the set
{f(t)}isis=�implemented of
( f(t) conditions
�𝐵𝐵� �𝑡𝑡�, , f𝐵𝐵2,�(t) �𝑓𝑓�𝑡𝑡��
�𝑡𝑡�,...,f(t) )�for �𝑓𝑓�𝑡𝑡�
isa set � , 𝑓𝑓of
implemented�, �𝑡𝑡� . . . , through
𝑓𝑓�𝑡𝑡�� �
expressions{B(t)} = (B1 (t),B2
� �𝑡𝑡�, �𝑡𝑡�,of
forfor aххa𝐵𝐵set�set of 𝐵𝐵� �𝑡𝑡�� 3.Similarly
. . . expressions�𝐵𝐵�𝑡𝑡��
expressions�𝐵𝐵�𝑡𝑡�� �𝐵𝐵
�𝐵𝐵 �𝑡𝑡�, 𝐵𝐵 �𝑡𝑡�, �𝑡𝑡�� implemented . . , 𝐵𝐵� n�𝑡𝑡��
.through
through
)���can be any. 𝑆𝑆𝑡𝑡�𝑡𝑡� where �
Q(t) forcan ��loop be 𝐵𝐵any.���𝑡𝑡�,
operators .....,,𝐵𝐵 𝐵𝐵���𝑡𝑡��
and others. 1
 (t),...,B 3.Similarly (t)) for is loop implemented operators ���� and  for 3.Similarly
a
through set
others. of
𝑆𝑆𝑡𝑡�𝑡𝑡�for loop
expressions�𝐵𝐵�𝑡𝑡��
���������������� operators ���� ���� and � others.
where
where �𝐵𝐵 �𝑡𝑡�,
�Q(t) Q(t) 𝐵𝐵
can �𝑡𝑡�,
� canbe any..be. . , 𝐵𝐵
any.� �𝑡𝑡�� is implemented through
����������������
���������������� ����
���� ����
� 𝑓𝑓�𝑡𝑡�–
𝑆𝑆where software beoperators willwill differ 𝑓𝑓�,only . .in that �the the aggregates �а�, �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡�� willwill
hers.where Q(t)  The can
3.Similarly
𝑆𝑆𝑡𝑡�𝑡𝑡�
𝑆𝑆𝑆𝑆𝑡𝑡�𝑡𝑡�
be хany.
process n of for loop operators
simultaneous check where
the𝑆𝑆and set others.
Q(t)
Q(t) can be
can
of conditions any.
any. �𝑓𝑓�𝑡𝑡��
х
х software 𝑓𝑓�𝑡𝑡�–
���������������� software ���� ���� � �𝑓𝑓�𝑡𝑡�
operators � ,differ �𝑡𝑡� .only , 𝑓𝑓�𝑡𝑡� in�that aggregates �а�, �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡��
•others. � 𝑓𝑓�𝑡𝑡�–
Similarly operators will �differ  only incorresponding
that the aggregates �а�, �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡�� will mentioned
offor loop operators � and others. �𝑡𝑡��thewhere Q(t) can be any.
be𝑆𝑆𝑡𝑡�𝑡𝑡� formed 3.Similarly for loop operators and others.
rators and   for 𝑆𝑆 a set software
𝑓𝑓�𝑡𝑡�–
3.Similarly
3.Similarly expressions�𝐵𝐵�𝑡𝑡��
for
for loop
loop operators operators
operators will �𝐵𝐵differ
and
and
be х� �𝑡𝑡�,
others.
others.
formed 𝐵𝐵fromonly
�𝑡𝑡�,from . .in . , 𝐵𝐵thatcorresponding isaggregates processes
implemented processes �а�, Sit(t)
�𝑝𝑝�,
through Sit(t) for for
�𝐵𝐵�𝑡𝑡��, the�𝑓𝑓�𝑡𝑡��
the above will
above mentioned programming
programming
r only in that the aggregates �а�, �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡�� will
Sbe formed from ���� corresponding processes Sit(t) for the andabove willmentioned
differ only inprogramming
� � �
𝑆𝑆� 𝑓𝑓�𝑡𝑡�– software operators that the aggregates �а�, �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡�� will
ors willSit(t) • 𝑆𝑆𝑡𝑡�𝑡𝑡�
differ be
only𝑆𝑆𝑆𝑆 f(t)–
formed
in that
����������������
3��𝑓𝑓�𝑡𝑡�–𝑓𝑓�𝑡𝑡�– software from
the
software
software aggregates operators
corresponding
����
operators
operators where
 �а�, Q(t) will
3.Similarly
operators
will
will �𝑝𝑝�,
operators
can differ
processesthrough
�𝐵𝐵�𝑡𝑡��,
differ
differbe any.
for
only
only only
through
loop
�𝑓𝑓�𝑡𝑡��
ininform
Sit(t) in
that
that will
form that
operators
(1) for
the
the or
(1) the or aggregates
forms
the
aggregates
aggregates forms
others.
(2)-(4)
above �а�,
�а�,
(2)-(4) for
mentioned
�𝑝𝑝�,
�𝑝𝑝�, {а(t)},{p(t)},{B(t)},{f(t)}
more
for �𝐵𝐵�𝑡𝑡��,
�𝐵𝐵�𝑡𝑡��,more complex
Sit(t)programmingfor thewill
�𝑓𝑓�𝑡𝑡��
�𝑓𝑓�𝑡𝑡��
complex operators.
will operators. will be formed from corresponding
cesses for operators хthe above
through mentioned
form (1) or programming
forms (2)-(4)
software
be formed
for more
operators
from complex corresponding
will operators.
differ only
processes
in that the aggregates
above mentioned programming
ponding processes
 processes
operators
be
3.Similarlybe Sit(t)
formed
formed for Sit(t)
for
through
loopfrom
from the for
operators form the
above
corresponding
corresponding (1)
and above 𝑆𝑆
or
others.𝑓𝑓�𝑡𝑡�–
mentioned
� forms mentioned (2)-(4)
processes
processes programming
operators programming
forSit(t)
Sit(t) more
through for
for complex
the
the
form operators
(1)above
above operators.
or forms through
mentioned
mentioned (2)-(4) for form
programming
programming
more (1) or forms
complex
�а�, �𝑝𝑝�,
operators. (2)-(4)�𝐵𝐵�𝑡𝑡��, more will
for�𝑓𝑓�𝑡𝑡�� complex operators.
2)-(4) for more complex operators. 3. tS-Program be formed from
Operators corresponding processes Sit(t) for the above mentioned programming
(1) or forms3. (2)-(4)
𝑆𝑆 operators
𝑓𝑓�𝑡𝑡�–
� operators
tS-Program for more
software through
through complex
operators
Operators form
form operators.
will (1)
(1) differ
3. or
or only
forms
forms
tS-Program in that
(2)-(4)
(2)-(4) the forfor
Operators aggregates
more
more �а�,
complex
complex �𝑝𝑝�, �𝐵𝐵�𝑡𝑡��,
operators.
operators. �𝑓𝑓�𝑡𝑡�� will
be formed from corresponding TheThe operators
ideology
processes through
of
Sit(t)
3. tS
tS-Programforandthe form𝑡𝑡�� �above (1) [2]orcan
Operators forms
mentioned be used (2)-(4) forfor
programming more complex
programming. Here operators.
are are some of the tS-program
3.3.ThetS-Program
tS-Programideology ofOperators
Operators
tSform and(1)𝑡𝑡�or [2] can ideology
be for used offortS and
programming. �� �and[2]
𝑡𝑡operators. can beare used for programming. Here some of the tS-program
operators through forms
� �operators. (2)-(4) The more ideology complex of tS 𝑡𝑡��Here [2] can some
be usedof forthe tS-program
programming. Here are some of the tS-program
used for programming. The
The 3.3. tS-Program
tS-Program
ideology
ideology Here of
of Operators
Operators
tS are and some 𝑡𝑡 of [2] can
operators.
the can tS-programbe
be used
used forfor programming.
programming. � Here
Here are are some some of ofthe the tS-program
tS-program operators.
[2] can be3.operators. 𝑡𝑡𝑡𝑡������3.[2] tS-Program Operators
� � operators.
used for programming. and Here

are some beofused the tS-program
The ideology ideology of tS tS and Simultaneous
[2] can used expelling
forexpelling programming. assignment Here of are the
are some expressions
some of the the tS-program
tS-program 𝑝𝑝� ,, .𝑝𝑝. . ,, .𝑝𝑝.�. ,�𝑝𝑝to�the variables
The of can be for programming. Here of �𝑝𝑝� � �𝑝𝑝
operators.
tS-Program Simultaneous Operators
expelling assignment
The Simultaneous
ideology of ofthe tSexpressions
Simultaneous and 𝑡𝑡�� � expelling [2]assignment
�𝑝𝑝� can � be �𝑝𝑝�used
assignment , 𝑝𝑝of� , .for
the
. .of expressions
programming.
, 𝑝𝑝 the to
�а� the variables
� � expressions
�𝑝𝑝� Here
�𝑝𝑝� ���,�𝑝𝑝are
�𝑝𝑝�� , some
𝑝𝑝�� , . . . , of𝑝𝑝���the totothe the
tS-program variables
variables
•The
 operators.
ideology
operators. Simultaneous
Simultaneous of tS and 𝑡𝑡
expelling
expelling [2] can be𝐴𝐴
assignment
assignment �used
𝐴𝐴 �а �
for
� ,�аа programming.
of
� ,
of, .а .
the .
the ,
, .а . �.
expressions
expressions
� . , а It’s�.
Here
�а� implemented
It’s
are
implemented
some
{p}=(p
�𝑝𝑝�
It’s � of
�𝑝𝑝
implemented
through
the
, ,p 𝑝𝑝tS-program
,...,p
,
through . . . ,
through)
𝑝𝑝 from � 𝑆𝑆
to 𝑡𝑡
�а� .
the
the�а�
𝑆𝑆 𝑡𝑡 variables
. variables
. A = (а ,а ,...,а ). It’s implemented through
ofassignment
the expressions 𝐴𝐴 ��𝑝𝑝� �а�� , а��𝑝𝑝 , .�. ,. 𝑝𝑝, �𝑝𝑝�
�� �
а��, .�..� .It’s to ,the
implemented
, 𝑝𝑝�𝑝𝑝�operators.
�, 𝑝𝑝 variables �through𝐴𝐴� � �а ,
� �� а , . . . , а
𝑆𝑆𝑡𝑡�.�𝑝𝑝� �. 1 � 2 � ��:����
n � 𝑆𝑆 𝑡𝑡 1 2 n
of
 �а�the
operators.
𝐴𝐴 Simultaneous

expressions
Simultaneous
�а , а , . . . ,
expelling
expelling
а �. It’s  �assignment� . . . , 𝑝𝑝� �of
assignment
Simultaneous
implemented
oftothe the
the
through
variables
expressions
expressions
expelling
��:�����а� �𝑝𝑝�
checks𝑆𝑆 𝑡𝑡 . � � the �𝑝𝑝��set
�𝑝𝑝 ,,𝑝𝑝𝑝𝑝��,of ,,𝑝𝑝𝑝𝑝���� ��:����
,......conditions toto the the�𝑓𝑓�
��:����
variables
variables � �𝑓𝑓 , 𝑓𝑓 . . . , 𝑓𝑓 � for a set of
d implemented
through ��:����  Simultaneous 𝑆𝑆𝑡𝑡�. �а � �expelling checks Simultaneous
ofSimultaneous  expelling
Simultaneous expelling assignment
expelling
� , 𝑝𝑝checks
of
checks
� �the to�the the
, set expressions
. ofset of
. . , 𝑓𝑓conditions conditions �𝑝𝑝� ��𝑓𝑓� �𝑝𝑝��, 𝑝𝑝��𝑓𝑓
�𝑓𝑓� � � , .��., .𝑓𝑓,�,
�𝑓𝑓
�, , 𝑓𝑓 �,𝑝𝑝�
..�.�. ,to�𝑓𝑓�the
. .
� , 𝑓𝑓 � for
� for variables
a set
a set of of
.,,.аа���.assignment the theexpressions the 𝑓𝑓�,variables
�а� � �𝑝𝑝���:����
Simultaneous
through𝐴𝐴𝐴𝐴 � �,,аа��,,..𝑆𝑆
�а���:���� ...𝑡𝑡expelling �. It’s It’s implemented
implemented set through
through of conditions � �а� �𝑝𝑝
�а�
𝑆𝑆𝑡𝑡�
𝑆𝑆�,
, . . . , 𝑝𝑝�
𝑡𝑡. .�..�𝑓𝑓� �𝑓𝑓 � ��а�for a set of
expressions �𝐵𝐵� �а� � �𝐵𝐵
expressions ,
�𝐵𝐵� 𝐵𝐵
�It’s�𝐵𝐵implemented . ,
�𝐵𝐵 𝐵𝐵 , �.
𝐵𝐵 .It’s
. . , 𝐵𝐵 implemented
�. It’s implemented through through 𝑆𝑆 � where Q can
𝑡𝑡 𝑆𝑆 𝑡𝑡 where Q can
� �.through . through
��:���� �
 𝐴𝐴Simultaneous � �а� , а� , . . . , �𝐵𝐵�
expressions �а��𝑓𝑓 �.expelling
It’s
𝑓𝑓�,implemented checks
�𝐴𝐴., .𝑓𝑓 .� 𝐵𝐵�а
expressions
,through the
� ,setа�set , .of ,of
.implemented
. �𝐵𝐵�𝑆𝑆а𝑡𝑡�.�. conditions
��:�����
� , 𝐵𝐵�, �𝑓𝑓� . . . , 𝐵𝐵�
� � �, �𝑓𝑓It’s� , 𝑓𝑓implemented. ��:���� 𝑆𝑆𝑡𝑡for
. �. 𝑆𝑆, 𝑓𝑓𝑡𝑡� �where a can set of
��������� ��������
���� �𝑆𝑆 𝑡𝑡 where Q can
� �
, 𝑓𝑓�It’s set of through foraaaQ
���������
set
checksof conditions
•  set
the Simultaneousof �𝑓𝑓� conditions ,��𝑓𝑓�
expelling �𝐵𝐵. .� . ,, 𝐵𝐵
𝑓𝑓�𝑓𝑓checks for �a.�.the set
��:����
for of conditions
aconditions {f} ����������� = �𝑓𝑓 (f�1�,,,�𝑓𝑓f𝑓𝑓�,2�,����
, �,......., f�n�� )for set of expressions
of��������� {B} = (B , B , ..., Bn ). It’s
�, . . the �set
� �,
Simultaneous
Simultaneous �expelling
expelling checks
�checks
be
� any. the be of
any. conditions �𝑓𝑓�
�𝑓𝑓� �𝑓𝑓 ..,,�𝑓𝑓𝑓𝑓 for set
set
It’s  Simultaneous expressions
be any. �𝐵𝐵�
expelling � checks
�𝐵𝐵 , 𝐵𝐵 the .
�  𝑆𝑆�,𝑡𝑡Simultaneous
� . set
.
be , 𝐵𝐵 of
any. �. It’s
conditions implemented
expelling �𝑓𝑓� � �𝑓𝑓
checks through
, 𝑓𝑓 . . . , 𝑓𝑓
the and � for
setothers. a set
of conditions ��
of 𝑆𝑆 𝑡𝑡 where Q can
�𝑓𝑓� � �𝑓𝑓� , 𝑓𝑓�, . . . , 𝑓𝑓� � for a set of1 2
𝐵𝐵�, .implemented through ��������� where � �Q can � �, �
. . , 𝐵𝐵� �. It’s implemented
implemented
expressions
expressions �𝐵𝐵�
�𝐵𝐵� through
through � � �𝐵𝐵
�𝐵𝐵
����  , ,
� 𝐵𝐵
𝐵𝐵 Similarly
. .. .. . , , 𝐵𝐵
𝐵𝐵 �.
�. for
𝑆𝑆 𝑡𝑡
It’s
It’s loop where
where
Similarly
implemented
implemented Q
operators Q
forcan can
loop be
operators
through
and
through any.
others. �
��������� ���� �� �
𝑆𝑆
𝑆𝑆 𝑡𝑡𝑡𝑡 where
where QQ can
can
 expressions It’s implemented through 𝑡𝑡 where Q can
�𝐵𝐵�
any. for � �𝐵𝐵� , 𝐵𝐵�, .�.���������� . , 𝐵𝐵�, �. Similarly
��,expressions 𝑡𝑡for loop operators . . . and 𝐵𝐵� �.others. 𝑆𝑆It’s
���� �� � ��������� ���� �� �
beSimilarly loop operators 𝑡𝑡�and others. �𝐵𝐵� –�software �𝐵𝐵 � , 𝐵𝐵 operators
��������� ,differ
���� ���������
will
� implemented
differ ����
justonly just because through aggregates �а�, �𝑝𝑝�, 𝑆𝑆𝑡𝑡�𝐵𝐵�, where �𝑓𝑓� willQ can be
�𝑡𝑡 – software
�� � operators will
�, only because aggregates ��������� �а�,���� �𝑝𝑝�,�𝑝𝑝�,��𝐵𝐵�, �𝑓𝑓� will be
be𝑡𝑡be be any.
any. any. – software operators will – software operators will differ only just because aggregates �а�, �𝐵𝐵�, �𝑓𝑓� willin be
 Similarly for loop operators beand

�differ
any. others.
� only formed just frombecause corresponding aggregates tS program operators in will
�а�, �𝑝𝑝�, �𝐵𝐵�, �𝑓𝑓� form be (1) for more complex operators
rs.
tors and others. • Similarly Similarly

Similarly
� �
Similarly for loop for
for loop
for loop
loop operators
operators operators
operators and others. formed
and
and and �
others.
from
others.
others. corresponding
forms (2)-(4). tS program operators in form (1) (1) for formore complex operators in in
𝑡𝑡formed –aggregates
software
from corresponding operators will
tS�а�, formed differ
program from
only
operators corresponding
just because
inbeform tS
aggregates
(1) program
for�𝐵𝐵�, more operators
�а�,
complex �𝑝𝑝�, in
�𝐵𝐵�, form
�𝑓𝑓� will be more complex operators
r only
ors willjust differ because𝑡𝑡only
��� software
𝑡𝑡�𝑡𝑡������–��just
software because
–– software
software operators
operators �а�,
aggregates
operators
operators will differ
�𝑝𝑝�, �𝐵𝐵�,
will Similarly
forms
will
will �𝑓𝑓�
differ
only
forms
�𝑝𝑝�,
differ
differ will
(2)-(4).
just for
only
�𝐵𝐵�,
only
(2)-(4).
be loop
because
only �𝑓𝑓�
Consider just
just
just operators
will because
aggregates
because
because
hierarchical
and �а�, others.
aggregates
aggregates�𝑝𝑝�,
aggregates
tS-program �𝑓𝑓��а�,
�а�, {а},{p},{B},{f}
operator will �𝑝𝑝�,be�𝐵𝐵�,
�𝑝𝑝�, �𝐵𝐵�,operators �𝑓𝑓� will
�𝑓𝑓� will
will
in be
be formed from corresponding tS program
be
formed forms
formed from(2)-(4).
from corresponding
corresponding tS 𝑡𝑡�tS
Consider
program –
program software
operators hierarchical operators
in formoperators in
tS-program
(1) for will
form
more differ
(1)
operator
complex for only more
operators just because
complexin aggregates
operators in �а�, �𝑝𝑝�, �𝐵𝐵�, �𝑓𝑓� will be
am operators
ding tS programoperators informed formin(1)
operators
formed form
from
from for
in form (1)
more
corresponding
corresponding for (1) more
complex for more complex
tS �operators
tS � complex
program
program
Consider operatorsin operators
operators
operators
hierarchical inin forms
in
in form(2)-(4).
form
tS-program (1)
(1) for
for more complex
more
operator complex operators operators in in
Consider
forms hierarchical tS-program operator
forms(2)-(4).
forms (2)-(4). formed from corresponding � � ���𝐴� tS program� �
𝑆𝑆𝑡𝑡 operators in form (1) for more complex operators in
Considerforms (2)-(4). tS-program operator
(2)-(4).
hierarchical

�𝑆𝑆𝑡𝑡 � � �, where D is oself-set for �𝐴𝐴 𝐴 𝐵𝐵 � ���𝐴𝐴 𝐴 𝐴𝐴��.
-program
rator operator Consider
Consider hierarchical
hierarchical tS-program
tS-program forms operator
(2)-(4).
operator � � � 𝐵𝐵 � ��
𝐴𝐴 𝑆𝑆 𝐴𝑡𝑡 𝐵𝐵� � �𝐴𝐴 � 𝐴𝐴 𝐴 𝐵𝐵�
Consider Consider hierarchical hierarchical tS-program � �𝑆𝑆𝑡𝑡 � �operator
�tS-program operator � �
� �
𝑆𝑆 𝑡𝑡 �, where D isDoself-set for for �𝐴𝐴 𝐴 �𝐴𝐴𝐵𝐵𝐴�𝐵𝐵���𝐴𝐴 𝐴 𝐴𝐴��.
���𝐴�
� � ����𝐴� 𝑆𝑆�𝑡𝑡 �Consider hierarchical tS-program operator
𝑆𝑆𝑡𝑡 �� 𝐵𝐵 ��, � 𝐴�,𝐵𝐵where is
𝐴 oself-set � ���𝐴𝐴 𝐴 𝐴𝐴��.
� ���𝐴�
��
𝑆𝑆𝑡𝑡 � � � � ���𝐴�𝑆𝑆𝑡𝑡 � � �
� where 𝐴𝐴�𝐴𝐴𝐴𝐵𝐵� D is�oself-set �𝐴𝐴 � 𝐴𝐴�𝐴for 𝐵𝐵� �𝐴𝐴 � ���𝐴𝐴 𝐴𝐴��.
� 𝐵𝐵 � 𝐴𝐴�𝐴� � 𝐵𝐵 𝐴 𝐵𝐵� � �𝐴𝐴 𝐴𝐴 𝐴 𝐵𝐵�
𝑆𝑆𝑡𝑡 �𝑆𝑆𝑡𝑡 � �
��� � �
𝐵𝐵� � �𝐴𝐴
�� ����𝑆𝑆�
𝑆𝑆𝑆𝑆𝑡𝑡𝑡𝑡𝐴𝐴�,𝐴where
𝑡𝑡
𝐵𝐵� D is oself-set for �𝐴𝐴 𝐴 𝐵𝐵 � ���𝐴𝐴 𝐴 𝐴𝐴��.
where D is�,�oself-set 𝑆𝑆where
𝑆𝑆𝑡𝑡𝑆𝑆𝑡𝑡𝑡𝑡�� ���D
� 𝐵𝐵
��for
� 𝐴𝐴 𝐴
is oself-set 𝐵𝐵�
�𝐴𝐴𝐴𝐴𝐴𝐴𝐵𝐵𝐵𝐵�
� �𝐴𝐴

���𝐴�
for �
���𝐴�
���𝐴� ���𝐴𝐴
𝐴𝐴
�𝐴𝐴 𝐴 𝐴 𝐵𝐵�
𝐴𝐵𝐵𝐴𝐴𝐴𝐴��.� ���𝐴𝐴 �,
�,3.1
�, 𝐴where
where
where Dynamic
𝐴𝐴��.
� �D D Disisisoself-set
tS oself-set
� �and 𝑡𝑡�𝑞𝑞��for
oself-set for
for � ��𝐴𝐴 �𝐴𝐴�𝐴𝐴 𝐴𝐴𝐴𝐵𝐵𝐵𝐵𝐵𝐵�
Programming �� ���𝐴𝐴
���𝐴𝐴
���𝐴𝐴 at𝐴 𝐴Time𝐴 𝐴𝐴��.
𝐴𝐴��. 𝐴𝐴��. q
𝐴𝐴 � 𝐴𝐴 𝐴 𝐵𝐵� �� ��𝐵𝐵𝐵𝐵𝐵𝐵� 𝐵𝐵�� ��𝐴𝐴 �𝐴𝐴��� � 𝐴 𝐵𝐵� ���𝐴�𝑆𝑆 𝑡𝑡 �, where
��𝐴𝐴𝐴𝐴𝐴𝐴𝐵𝐵� � �𝐴𝐴 𝑆𝑆𝑡𝑡𝐴𝐴
� 𝐴𝐴�𝐴 𝐴�𝐵𝐵� 𝐵𝐵� The ideology of tS and 𝑡𝑡�� � can be usedDforisdynamic oself-setprogramming for �𝐴𝐴 𝐴 𝐵𝐵[2]. � ���𝐴𝐴 Here are 𝐴 𝐴𝐴��.some of the tS-
3.1 3.1 Dynamic � 𝐵𝐵 tS � 𝐴𝐴and 𝐴 𝐵𝐵� 𝑡𝑡�𝑞𝑞� ���𝐴𝐴 � Programming
� 𝐴𝐴 𝐴 𝐵𝐵� at Time q q
3.1Dynamic
3.1 Dynamic tS and tS and 𝑡𝑡�𝑞𝑞��𝑡𝑡�𝑞𝑞� Programming Programming Dynamic at dynamic
Time tS at
q and Time 𝑡𝑡�𝑞𝑞�
programming � q � � Programming
operators. at Time
��The ideology of tS and 𝑡𝑡�� �𝑡𝑡 can besimultaneous
used for for dynamic programming assignment [2]. of Here the are some of�𝑝𝑝�𝑡𝑡�� the tS-
�� � �
The ideology The
of tS processand ofcan beare used expelling expressions �
The ideology oftS tS 𝑡𝑡and becan befor used for�𝑝𝑝 dynamic programming ofdynamic programming tS- [2]. Here are some of the tS-
, 𝑝𝑝� �𝑡𝑡�� to [2]. the Here aretS-some а�𝑡𝑡� �of�аthe
The ideology of tS and 𝑡𝑡can used dynamic programming �.[2]. Here some the
ming
� Programming
at Time 3.1
3.1 3.1
3.1 q Dynamic
Dynamic Dynamic
Dynamic at Time tS
tS q
tS andand
and
and
��𝑡𝑡�𝑞𝑞�
�𝑡𝑡�𝑞𝑞�
𝑡𝑡�𝑞𝑞� �� �dynamic
������� Programming
Programming
Programming
Programming programming �at at
at
�𝑡𝑡�,
at Time
Time
Time 𝑝𝑝 � �𝑡𝑡�,q
operators.
Time
�.q
q�.q variables � �𝑡𝑡�, а� �𝑡𝑡�, . . . , а� �𝑡𝑡�� is implemented
dynamic
dynamic programming
programming operators. operators. 3.1dynamic
� �
Dynamic programming
tSthroughand 𝑡𝑡�𝑞𝑞��operators. �а���� Programming at Time q
candynamic
be used The for dynamic
ideology ofprogramming
tS tSand  [2]. The Here
be used are
process some dynamic
of of the tS- � 𝑆𝑆𝑡𝑡�𝑡𝑡�.
programming
simultaneous [2].
expelling Here are
assignment some ofof the
of tS- expressions
ofthetS-
The The
The ideology ideologyof
ideology ofof
of tS
tS and and
and 𝑡𝑡𝑡𝑡��� �are can
can
can bebe
be used
used for
for for dynamic
dynamicdynamic �programming
programming
programming [2].
[2]. Here
Here
[2]. Here are
are �some some
are someof the
the of tS-
tS-the �𝑝𝑝�𝑡𝑡�� � � operators.
for  programming
The
Theprocess process [2]. of Here
simultaneous � �The
simultaneous some expelling
The
ideology of the process
expelling
of tS-
assignment
tS and of��:�������
assignment
𝑡𝑡 of
simultaneous
can the expressions
be used of for expelling
the �𝑝𝑝�𝑡𝑡��
dynamic expressions assignment
programming �𝑝𝑝�𝑡𝑡�� �[2]. the dynamic
Here expressions
are some programming
of �𝑝𝑝�𝑡𝑡��
the tS-
ators. •dynamic
dynamic
�𝑝𝑝The
dynamic � �𝑡𝑡�, process 𝑝𝑝programming
�programming
�𝑡𝑡�, . . . , of
programming 𝑝𝑝� �𝑡𝑡�� simultaneous operators.
operators.
to the variables�𝑝𝑝 �𝑡𝑡�,
� �𝑝𝑝 expelling 𝑝𝑝
�𝑡𝑡�, �𝑡𝑡�,

�а�𝑡𝑡� 𝑝𝑝
2. . . .
�assignment
�𝑡𝑡�,
The
, 𝑝𝑝
�а.�.�𝑡𝑡�, process
�𝑡𝑡��
� �
�. , 𝑝𝑝а��𝑡𝑡��
� to
�𝑡𝑡�, .of . .tothe
of
, аthe variables
simultaneous
�𝑡𝑡��
� the is implemented
expressions
variables а�𝑡𝑡� expelling�
{p(t)}=(p
а�𝑡𝑡� �а �
check
�𝑡𝑡�,
� �а �𝑡𝑡�, а (t),p the
�𝑡𝑡�,
� а �𝑡𝑡�, . . set
. , а
(t),...,p
. .
of
�𝑡𝑡��
�. , а (t)) �𝑡𝑡��is
conditions
from implemented
is
�𝑓𝑓�𝑡𝑡��
the �
variables
implemented а(t)=(а1 (t),а2
�𝑝𝑝� �𝑡𝑡�, 𝑝𝑝�а���� � �𝑡𝑡�, . . . , 𝑝𝑝� �𝑡𝑡��dynamic to the �programming variables � �𝑓𝑓�𝑡𝑡�
�а���� а�𝑡𝑡� , 𝑓𝑓 � � �а
operators.
�𝑡𝑡� . .�. �𝑡𝑡�,
, 𝑓𝑓�𝑡𝑡� а����𝑡𝑡�, for . . a. , set
а� �𝑡𝑡�� of is implemented
expressions�𝐵𝐵�𝑡𝑡�� �1 �2 � �𝐵𝐵 �𝑡𝑡�, n�𝐵𝐵 �𝑡𝑡�, . . . , 𝐵𝐵 �𝑡𝑡�� is
multaneous expelling  The
through TheThe
(t),...,а process assignment
process
process
(t)) 𝑆𝑆
is 𝑡𝑡�𝑡𝑡�. of
ofof
implemented of
simultaneous
simultaneous
simultaneous the
through through expressions expelling
expelling
expelling 𝑆𝑆
�а���� �𝑝𝑝�𝑡𝑡��
𝑡𝑡�𝑡𝑡�.

assignment
�, �
assignment
assignment ofofof the
the the expressions
expressions
expressions �𝑝𝑝�𝑡𝑡��
�𝑝𝑝�𝑡𝑡��
�𝑝𝑝�𝑡𝑡�� �� � � � �
expelling assignment through ��:������� of the
�а���� expressions through �𝑝𝑝�𝑡𝑡��
��:������� � of 𝑆𝑆𝑡𝑡�𝑡𝑡�.
𝑆𝑆𝑡𝑡�𝑡𝑡�. �𝑡𝑡�, .to . .The process simultaneous expelling assignment of can thebe any. expressions �𝑝𝑝�𝑡𝑡��
����
implemented �
�through , where Q(t) 3.Similarly for loop
n 𝑆𝑆is
to the variables
ables а�𝑡𝑡� �2.�𝑝𝑝 �а�𝑝𝑝�𝑝𝑝 ���𝑡𝑡�,
The а�𝑡𝑡�
�𝑡𝑡�,
��𝑡𝑡�, 𝑝𝑝 �
���𝑡𝑡�,
process �а.�..of
�𝑡𝑡�,
𝑝𝑝𝑝𝑝��:�������
��𝑡𝑡�, .�𝑡𝑡�,
....,,,,а 𝑝𝑝��а��𝑡𝑡��
��𝑡𝑡��
𝑝𝑝𝑝𝑝simultaneous
�𝑡𝑡��  isto
, аthe
the
the �𝑡𝑡��
expelling
2.�𝑝𝑝implemented
�The variables
variables is��:�������
process
implemented
check а�𝑡𝑡�
а�𝑡𝑡�
а�𝑡𝑡�
ofthe �� �а
�а
set ��𝑡𝑡�,
�а���𝑡𝑡�,
simultaneous of а�а��𝑡𝑡�,
��𝑡𝑡�,
аconditions
�𝑡𝑡�,���������������� �𝑡𝑡�, ..... ..,,.аа�𝑓𝑓�𝑡𝑡��
expelling �𝑡𝑡��
а�𝑡𝑡��
,���� � �𝑡𝑡��
�����
checkis𝑡𝑡�𝑡𝑡� implemented
isimplemented
implemented
theаthe set set of conditions �𝑓𝑓�𝑡𝑡�� � �
� �𝑡𝑡�, а� �𝑡𝑡�, . . ��
2. The
, 𝑓𝑓�, �𝑡𝑡�process

�offorsimultaneous  2. �𝑡𝑡�, 𝑝𝑝
The �𝑡𝑡�,
� expelling .
process
operators. . , 𝑝𝑝 � and�𝑡𝑡��of
� others.
check to
simultaneousthe
the𝐵𝐵� �𝑡𝑡�, variables
set . . of expelling а�𝑡𝑡�
conditions � �аcheck �𝑡𝑡�, �𝑡𝑡�, . . . , а of �𝑡𝑡�� is
conditions implemented �𝑓𝑓�𝑡𝑡��
•  �𝑓𝑓�𝑡𝑡�
����
.����
. .����
, 𝑓𝑓�𝑡𝑡� a set �of expressions�𝐵𝐵�𝑡𝑡�� �𝐵𝐵� �𝑡𝑡�, is � �𝑓𝑓�𝑡𝑡�� � � �
through
through
through
The �
process of simultaneous 𝑡𝑡�𝑡𝑡�.
𝑆𝑆𝑆𝑆𝑆𝑆�𝑡𝑡�𝑡𝑡�.
𝑡𝑡�𝑡𝑡�. �𝑓𝑓�𝑡𝑡� expelling
� , 𝑓𝑓�,𝑡𝑡�𝑡𝑡� .–check
���� . .software
, 𝑓𝑓�𝑡𝑡� the set
� �operators forofa conditions set 𝐵𝐵� �𝑡𝑡��
of . ,expressions�𝐵𝐵�𝑡𝑡��
{f(t)} just .= (f(t)1,aggregates f�2,(t) �𝐵𝐵..., �𝑡𝑡�,f(t) 𝐵𝐵n� )�𝑡𝑡�, for�𝑡𝑡�,
. .a. ,set of
𝐵𝐵�expressions{B(t)}
.𝐵𝐵. �. ,�𝑡𝑡�� �𝑡𝑡��is is = (B1
𝑓𝑓�𝑡𝑡�� � forthrough � �befor willa3.Similarly
set
differ ofonly expressions�𝐵𝐵�𝑡𝑡�� because {a(t)}, {p(t)},
��:�������
��:�������
��:������� �𝑓𝑓�𝑡𝑡� �, �𝑓𝑓 �𝑡𝑡� 𝑆𝑆. 𝑡𝑡�𝑡𝑡�.
. . Q(t)
, 𝑓𝑓�𝑡𝑡� � ��𝐵𝐵
� �𝑡𝑡�, 𝐵𝐵 �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡��
�𝑓𝑓�𝑡𝑡�� , 𝑓𝑓
implemented �𝑡𝑡� . . . ,����������������
through a set
����
𝑆𝑆 �of
𝑡𝑡�𝑡𝑡� ��,,expressions�𝐵𝐵�𝑡𝑡��
where can any. � �𝐵𝐵 �𝑡𝑡�, 𝐵𝐵 for �𝑡𝑡�,
loop . . , 𝐵𝐵 �𝑡𝑡�� is �
imultaneous 
 2.2. The (t),B
expelling 2. The
The (t)
2 the process
,...,
�, check
process
process B n of of
(t)) the of is setimplemented
simultaneous
simultaneous of
simultaneous
implemented conditions through
��:�������
expelling
expelling
through
expelling �𝑓𝑓�𝑡𝑡�� check
check �
check the
the the���� set �
setset����
����
of
of of𝑆𝑆����

conditions
conditions
𝑡𝑡�𝑡𝑡� , tS(t)
conditions where where �
for Q(t) �𝑓𝑓�𝑡𝑡��
�𝑓𝑓�𝑡𝑡�� Q(t)can can be
�be�any.programming
� any.
3.Similarly for loop
expelling  check
���� ����
setthrough conditions will be formed from corresponding processes above�𝑓𝑓�𝑡𝑡�� mentioned operators
implemented  �𝑡𝑡�, 2. implemented
The�𝑓𝑓�𝑡𝑡�� ����
process � through of(1) simultaneous
,����������������
where Q(t) expelling 𝑆𝑆𝑡𝑡�𝑡𝑡� check , where theQ(t) setcanofbe conditions any. 3.Similarly �𝑓𝑓�𝑡𝑡��for � loop
�can be any. 3.Similarly for loop
operators and others. 𝐵𝐵𝑆𝑆�form
𝑡𝑡�𝑡𝑡�
� for a set •𝑡𝑡 of Similarly
expressions�𝐵𝐵�𝑡𝑡��
�𝑓𝑓�𝑡𝑡��𝑓𝑓�𝑡𝑡�
�𝑓𝑓�𝑡𝑡� ,𝑓𝑓�,
�,�,𝑓𝑓 for
𝑓𝑓�, �𝑡𝑡�loop
�𝑡𝑡�
�𝑡𝑡�
�, . ........,,,𝑓𝑓�𝑡𝑡� operators
𝑓𝑓�𝑡𝑡�
𝑓𝑓�𝑡𝑡� �𝐵𝐵
�����������������
���� �for for
for
operators and
aa𝐵𝐵
ajust set
�set
set others.
�𝑡𝑡�,
���� of
and . ����
of
through
of �𝑡𝑡��
. . expressions�𝐵𝐵�𝑡𝑡��
,expressions�𝐵𝐵�𝑡𝑡��
expressions�𝐵𝐵�𝑡𝑡��
others. is
or form
���������������� (2)� for
� �𝐵𝐵 more
�𝐵𝐵 ����
�𝐵𝐵 �𝑡𝑡�,
��𝑡𝑡�, complex
����
�𝑡𝑡�, 𝐵𝐵𝐵𝐵�𝑓𝑓�𝑡𝑡���𝑡𝑡�,
��𝑡𝑡�,
𝐵𝐵 �𝑡𝑡�,operators.
.......,.,𝐵𝐵.𝐵𝐵�,�𝐵𝐵 �𝑡𝑡��
�𝑡𝑡�� �𝑡𝑡�� isis is
of expressions�𝐵𝐵�𝑡𝑡�� – software
operators
� � operators will
�𝐵𝐵� �𝑡𝑡�, 𝐵𝐵� �𝑡𝑡�, . .�𝑓𝑓�𝑡𝑡� �
differ
� only
. , 𝐵𝐵
operators �𝑡𝑡��
, because
𝑓𝑓 �𝑡𝑡�
Consider is
and . . aggregates
. , 𝑓𝑓�𝑡𝑡�
others.
hierarchical � {a(t)},
for dynamic a {p(t)},
set of �
�𝐵𝐵�𝑡𝑡��,
tS-program � �
expressions�𝐵𝐵�𝑡𝑡�� �
operator: � � �𝐵𝐵 �𝑡𝑡�, 𝐵𝐵 �𝑡𝑡�, . . . , 𝐵𝐵 �𝑡𝑡�� is
,and others.
�� � ���� � � �, ���� � � � �
���� will
����be implemented
implemented
formed𝑆𝑆𝑡𝑡�𝑡𝑡�from
implemented where through
through
through
corresponding Q(t) can be–any.
𝑡𝑡���processes software 3.Similarly
tS(t)
����
operators
for
����𝑆𝑆𝑆𝑆𝑡𝑡�𝑡𝑡�
above 𝑆𝑆 formentioned
𝑡𝑡�𝑡𝑡�
𝑡𝑡�𝑡𝑡� loop
,,will
, where
where
where differ Q(t)
Q(t) Q(t)
programming onlycan
can can be
be
justbe any.
any. because
any.
operators 3.Similarly
3.Similarly
3.Similarly aggregates forfor
for loop
loop {a(t)},
loop {p(t)}, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡��
�������������
𝑆𝑆 𝑡𝑡�𝑡𝑡� , where
𝑡𝑡��� –form
����
Q(t)
software can be
operators any. 3.Similarly 𝑡𝑡
����������������
willwill
���������������� implemented
differ – software
for
only ����
���� loop through
����
just because
���� operators will
aggregates differ only
{a(t)},
���� just
𝑆𝑆{p(t)},
𝑡𝑡�𝑡𝑡� because, where
�𝐵𝐵�𝑡𝑡��, aggregates
Q(t)�𝑓𝑓�𝑡𝑡�� can be{a(t)},
any. {p(t)},
3.Similarly �𝐵𝐵�𝑡𝑡��,
for �𝑓𝑓�𝑡𝑡��
loop
�� ���� through operators
operators
software(1) or and
and form operators
others.
others. (2) for more
����������������
willwill

be� � differ
complex formed
���� only
operators. from
���� just
corresponding because
���������������� aggregates
processes ����
𝑡𝑡�𝑞𝑞�
���� tS(t) {a(t)}, for for {p(t)},mentioned
above {B(t)},{f(t)}
� ���������𝐴���� programming will
�� be formed from corresponding
𝑆𝑆𝑡𝑡�𝑞𝑞� operators
will
processes
Consider operators
be formed tS(t)
hierarchical and from
for others.
above
dynamic corresponding mentioned
tS-program operators be formed
processes
operator: and
programming from
tS(t)
others. corresponding
for
����
above
operators
𝑆𝑆 𝑡𝑡�𝑞𝑞� mentioned
� through
� processes programming
form tS(t)
�� ������𝐴������������𝐴������
(1) or above
formoperators mentioned
(2) for more programming
complex � operators. operators
will differ only 𝑡𝑡𝑡𝑡������just because
––software
softwareoperators
software aggregates
operators through
operators will{a(t)},
will differ
differ {p(t)},
form only
only (1)�𝐵𝐵�𝑡𝑡��,
or form
just
just because
because (2) (2)
�𝑓𝑓�𝑡𝑡��
���� for more
aggregates
aggregates complex {a(t)},
{a(t)}, operators.
{p(t)},
{p(t)}, �𝐵𝐵�𝑡𝑡��,
�𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡��
�𝑓𝑓�𝑡𝑡��
ly just because 𝑡𝑡
through
�� � aggregates – form (1) or form
{a(t)},dynamic (2)
{p(t)}, will for through
differ
more
𝑡𝑡��� �𝐵𝐵�𝑡𝑡��, – software form
only
complex
�𝑓𝑓�𝑡𝑡�� (1)
just
operators or
operators. form
because willtS-program for
aggregates
differ more complex
�𝐵𝐵�𝑞𝑞�{a(t)},
onlyoperator: � 𝐴𝐴�𝑞𝑞� operators.
{p(t)}, ∩ 𝐵𝐵�𝑞𝑞�� �𝐵𝐵�𝑡𝑡��,�
just because aggregates {a(t)}, {p(t)}, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡�� �𝐴𝐴�𝑞𝑞� �𝑓𝑓�𝑡𝑡��
� 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
ponding Consider
processeswill be
will betS(t) hierarchical
formed
formed for above from corresponding
from mentioned
corresponding Consider tS-program
programminghierarchical
processes
processes operator:
tS(t)
tS(t) dynamic
operators for above abovetS-program mentioned programming operators operators
Consider hierarchical �for dynamic mentioned programming
operator:
��
Consider
will be formed hierarchical
���� from corresponding dynamic will tS-program
𝑡𝑡�𝑞𝑞���������𝐴������������𝐴������
be processes
formed operator:
from tS(t) for
corresponding above 𝑆𝑆𝑡𝑡�𝑞𝑞�
mentioned
processes tS(t)programming for above mentioned operators programming operators
esses tS(t)
) for more complex for
through above
throughoperators. form mentioned
form
���� (1) 𝑆𝑆 𝑡𝑡�𝑞𝑞�
(1) or or form � programming

form (2) (2) for for more more complexoperators
complex operators. operators.
���������𝐴����

mplex
mic through
operators.
tS-program operator: form (1) or form (2)
�𝐵𝐵�𝑞𝑞� for
through � more
𝐴𝐴�𝑞𝑞� ∩complex
form (1)operator:
𝐵𝐵�𝑞𝑞�� � operators.
or form (2) for more complex operators. �
�𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� ��
Consider
Consider hierarchical dynamic
hierarchical dynamic tS-program
tS-program ����operator: 𝑡𝑡�𝑞𝑞� 𝑡𝑡�𝑞𝑞�
�� ������𝐴������������𝐴������ �� � ���������𝐴����
���������𝐴���� 𝑆𝑆𝑡𝑡�𝑞𝑞�
��
𝑆𝑆𝑡𝑡�𝑞𝑞�
m operator: J Consider
Sen Net Data hierarchical Comm, dynamic
2023 𝑡𝑡�𝑞𝑞�
Consider tS-program hierarchical operator:
𝑆𝑆
���� 𝑡𝑡�𝑞𝑞� dynamic� � �
tS-program � operator:
������𝐴������������𝐴������ 𝑆𝑆 𝑡𝑡�𝑞𝑞� � � Volume 3 | Issue 1 | 141
���� �� ������𝐴������������𝐴������
���� 𝑆𝑆 𝑡𝑡�𝑞𝑞� � � �
���������𝐴����
����𝑆𝑆 𝑡𝑡�𝑞𝑞� � � ��
���� �𝐵𝐵�𝑞𝑞� �𝐵𝐵�𝑞𝑞� � 𝐴𝐴�𝑞𝑞�
� 𝐴𝐴�𝑞𝑞�∩ 𝐵𝐵�𝑞𝑞��
� ∩� 𝐵𝐵�𝑞𝑞�� � � �𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
� �𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
𝑡𝑡�𝑞𝑞���������𝐴������������𝐴������ � ���������𝐴���� 𝑡𝑡�𝑞𝑞�
𝑡𝑡�𝑞𝑞� �𝐵𝐵�𝑞𝑞� 𝑆𝑆�𝑡𝑡�𝑞𝑞�𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� � �𝐴𝐴�𝑞𝑞�
������𝐴������������𝐴������ �
� 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
� ���������𝐴���� � �
�𝑆𝑆�𝑡𝑡�𝑞𝑞�
𝑡𝑡�𝑞𝑞�
� ����
���� �� ������𝐴������������𝐴������ � ���������𝐴����𝑆𝑆 ��
� ��������
���� 𝑆𝑆𝑆𝑆𝑡𝑡�𝑞𝑞�
𝑡𝑡�𝑞𝑞�� �� �𝑡𝑡�𝑞𝑞�
𝑆𝑆 ��𝑡𝑡�𝑞𝑞�����������𝐴������������𝐴������ ���� 𝑡𝑡�𝑞𝑞���� ���������𝐴����𝑆𝑆𝑡𝑡�𝑞𝑞�
������𝐴������������𝐴������ �� � ���������𝐴����𝑆𝑆𝑡𝑡�𝑞𝑞�
�𝐵𝐵�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
𝐴������������𝐴������
���� �
���������𝐴���� 𝑆𝑆 𝑡𝑡�𝑞𝑞�
�𝐴𝐴�𝑞𝑞� � � �
𝐴𝐴�𝑞𝑞� ∩
�𝐵𝐵�𝑞𝑞�
�𝐵𝐵�𝑞𝑞�
� 𝐵𝐵�𝑞𝑞�� � � 𝐴𝐴�𝑞𝑞�
𝐴𝐴�𝑞𝑞�
���� 𝑆𝑆 𝑡𝑡�𝑞𝑞�
∩∩ 𝐵𝐵�𝑞𝑞��
𝐵𝐵�𝑞𝑞�� � �
� � �𝐴𝐴�𝑞𝑞�
�𝐴𝐴�𝑞𝑞� �� 𝐴𝐴�𝑞𝑞�
𝐴𝐴�𝑞𝑞� ∩∩ 𝐵𝐵�𝑞𝑞��
𝐵𝐵�𝑞𝑞�� � �
𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� � �𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� �𝐵𝐵�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� � �𝐵𝐵�𝑞𝑞� �𝐴𝐴�𝑞𝑞� � � 𝐴𝐴�𝑞𝑞�
𝐴𝐴�𝑞𝑞�∩∩𝐵𝐵�𝑞𝑞�� 𝐵𝐵�𝑞𝑞��� �𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��
𝑡𝑡��� – software operators will differ only just because aggregates {a(t)}, {p(t)}, �𝐵𝐵�𝑡𝑡��, �𝑓𝑓�𝑡𝑡��
will be formed from corresponding processes tS(t) for above mentioned programming operators
through form (1) or form (2) for more complex operators.
Consider hierarchical dynamic tS-program operator:

��
���� 𝑡𝑡�𝑞𝑞���������𝐴������������𝐴������ � ���������𝐴����𝑆𝑆𝑡𝑡�𝑞𝑞�
����𝑆𝑆 𝑡𝑡�𝑞𝑞� �� �
�𝐵𝐵�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞�� � �𝐴𝐴�𝑞𝑞� � 𝐴𝐴�𝑞𝑞� ∩ 𝐵𝐵�𝑞𝑞��

S1eS-Program
e -ProgramOperatorsOperators (form
1
(form S � 1� �
� )� � �
�𝑆𝑆e𝑡𝑡-Program Operators� (form 𝑆𝑆 𝑡𝑡� )
� � �
� � � �
1 For
S 1
e -Program ������ Operators
� S 1
e -Program
����������������(form S e 𝑆𝑆 Operators
-Program
1 ����
� 𝑡𝑡
����� ) (form
Operators � 𝑆𝑆
(form 𝑡𝑡� ) 𝑆𝑆 �
𝑡𝑡� ) ���� ����

1 example,Operators
S Se e-Program
-Program Operators
��:������� (form
𝑆𝑆 ������
𝑡𝑡������ � �
𝑆𝑆𝑡𝑡�𝑡𝑡)�example,

(form�����������������
𝑆𝑆�For � � �
) . ��������������������
������
����
������
𝑆𝑆 �
𝑡𝑡
����������������

���� ���� .

For example, ������
������ For
𝑆𝑆� 𝑡𝑡example,
� �����������������
���������������� For
����
���� example,
�������� ��:�������
������
����������������
. 𝑆𝑆� 𝑡𝑡�������
𝑆𝑆 𝑡𝑡������ ������
� � .
���� ����
.
For example,
ForSexample, 𝑆𝑆 𝑡𝑡
��:�������
𝑆𝑆 ������
𝑡𝑡������ (form ������ . .
��:������� ��:������� 𝑆𝑆 𝑡𝑡 ∗
S1ee -Program Operators 𝑡𝑡�� )�𝑆𝑆 𝑡𝑡� ) operator: (form
1 � � �
� � �� � � � � �
� �
Consider hierarchical
-Program Operators
��:�������
��:������� dynamic(form ��S𝑆𝑆1�e-program �� � � �. � � �
𝑆𝑆 𝑡𝑡 ∗ 𝑆𝑆 𝑡𝑡 ∗ �𝑆𝑆 𝑡𝑡� ∗
Consider hierarchical �dynamic
� � 𝑆𝑆� 𝑡𝑡 �S e-program
1 � operator: (form
� � 𝑆𝑆 𝑡𝑡 ∗ �.
𝑆𝑆�Consider hierarchical ���� dynamic 𝑆𝑆S���
1 𝑡𝑡e-program

operator: (form
ForConsider hierarchical dynamic S����e-program operator: 𝑆𝑆(form
𝑡𝑡 ∗ ∗S�1e-program
1 � �
� � ���.� � �.�𝑆𝑆 � 𝑡𝑡 �
���������������� ����
Consider hierarchical dynamic � � � �. operator: (form
������
������ � ���������������� ����
For
Consider
Consider example,
example,
hierarchical
Consider hierarchical
hierarchical
��:�������
𝑆𝑆dynamic
dynamic
dynamic
��:�������
𝑡𝑡������
𝑡𝑡������ S1SSe-program
e-programoperator:
1e-program .operator:
operator: . (form
(form� �� ��� ��� �. �.��� 𝑆𝑆 𝑡𝑡 𝑆𝑆 𝑡𝑡 𝑆𝑆 𝑡𝑡 ��� �
� � ����𝑆𝑆 𝑆𝑆𝑡𝑡�𝑡𝑡 � � ��� ���� �
- Program
Set1Consider Operators (form �
𝑡𝑡 � ) �𝑆𝑆 𝑡𝑡� ∗ ��� � �� �
hierarchical dynamic �𝑆𝑆
S1e-program 1� � operator: (form � � � �. �𝑆𝑆 𝑡𝑡� ∗
Consider hierarchical dynamic S e-program
Set - Program operator: 𝑆𝑆
Operators (form
𝑡𝑡 �(form � �. �𝑡𝑡 � ) �
Set 1-�
Set
� Set
Program
� �1�-� Program
- �Program
1Set ��
1

�� Operators
- �Program ��
Operators Operators
���
, �� (form
Operators
� �Set
, �
(form
(form � -� Set
Program
�(form
� - Program
� ��𝑆𝑆𝑡𝑡��𝑡𝑡) ) �

� �1�� �𝑆𝑆 � �1�

1


𝑆𝑆� 𝑡𝑡� ) Operators
Operators
� ���
(form �
𝑆𝑆
����(form
���
� 𝑡𝑡�𝑆𝑆 )�𝑡𝑡��𝑆𝑆�� 𝑆𝑆�� 𝑡𝑡� )
�� �� �� �� � � �� , �
Set - Program � �Operators ����, � ���𝑆𝑆� , 𝑡𝑡�� )�� ��� ��� �� � �� ����� , � ���� ������ �� �� � �
�(form
� � ��� � �, �
� � �� ������ �� ����� ��� � � �
� �� 1�
� �������� ���
����� � ���
�� �
𝑆𝑆𝑆𝑆 Set - Program Operators (form —program
� � �
� �

,
, �

����
� � �
�������

�� ��
�� �

�������� ����
� �
���� �
��
� �� ��,������ � , ������� �� � � �� �� ��� ��� � structure example, where the assemblage point

� ��� � � ����
1 ��
�� �

� �
� ��� �
� � ����� �����
� , �
�� � � � �
��
, ��
� ������ , �

������� � � ��� ���
���� � , ���
� �� � � �� � � �
� � ����
�� � �

� �
����� �� ��� �
� �
� ��� ��
�� � , ��𝑆𝑆 𝑡𝑡 )

�� �
���� �
𝑆𝑆𝑆𝑆 self—program.
�� —program structure example, where assemblage
the assemblage po
𝑑𝑑 is 𝑆𝑆𝑆𝑆 the cursor [2], it is quite 𝑆𝑆𝑆𝑆 complex —program example,—program
structure example, structure
where thedr isexample, cursor where
assemblage it is the
point where thepoint
� �� �� �� �
𝑆𝑆𝑆𝑆—program structure
structureexample, where
wherethe assemblage point
��
𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆
����
� � � �
𝑆𝑆𝑆𝑆��� �������� � �� ��
� � � �
��� ��, � �
� � �� —programprogram
� ���
� ��� �
structureexample,
structure —program
example,where wherethe theassemblage
assemblagepoint
point the—program
assemblage point
structure
the [2],example, quite complex asse
�� �� �� �� � , ����
is the[2], cursor �� �
isquite the 𝑑𝑑cursor is the[2], cursor it is[2], quite it is quite complex
complex self—program. self—program.
𝑑𝑑 𝑑𝑑 isisthe the𝑑𝑑cursor cursor [2],it itisis[2], quite
quite it𝑑𝑑complex
iscomplex complex
self—program.
self—program. self—program.
� � 𝑑𝑑� is� the cursor [2],
Remark.𝑆𝑆𝑆𝑆
self—program.
� �it�is quite complex �
Energy of a living organism: self—program. 𝑑𝑑� is the
—program cursor [2], structure it is quite example, complex where self—program.
the assemblage point
��
� � � ����Remark.�, � � � �
Energy of a living organism:
Remark.
Remark. Remark.
𝑑𝑑Remark. isEnergy
� Remark. the
Energy cursor
Energy
Energy of
� of a�of�[2],
� of
Energy aliving �it
�a�living
living

�a living�of is quite
Remark.
organism:
� aorganism:
� �
living
organism: , ��complex
organism: Energy
organism: � ���� �
self—program.
of
� a living organism:
� � �� � � �
� � � � �
��� � �����
f(r, a(𝐸𝐸� )) =𝑆𝑆𝑆𝑆������������������������������������������, ������ ��� �,���������������
� � � ��� Remark.
���, �
� �, �

� ���� � �
���� � �� �Energy
�, �
��� � ����
� ��� � � � �

�of
� � �
���a
�� � � � �� � � �
� �living
� �
�� ����organism:
, ��
����� , � � � �
� , � � � � � ���� �
� �� � � �
� � ����������� ������, �,�� �� � � ��
� Remark. � a(𝐸𝐸� ))Energy
f(r, =𝑆𝑆𝑆𝑆 � of a living � � ��organism:�� � , ���� � � ����� �� � , �� � ���� � ��� � , � � � �
-internal energy ���
of� �a�living
���
organism, f(r, a(𝐸𝐸 )) =𝑆𝑆𝑆𝑆

q- a gap���in the � ��energy

��� � ofcocoon of a living
�𝑆𝑆 𝑡𝑡a(𝐸𝐸 � � �� � �
� � � � � � � ���� �organism, r-
f(r,f(r, a(𝐸𝐸 �� �f(r,))))=𝑆𝑆𝑆𝑆 =𝑆𝑆𝑆𝑆
a(𝐸𝐸 ��))
��
=𝑆𝑆𝑆𝑆
� � ��
f(r, organism,
a(𝐸𝐸
�� �
� )) =𝑆𝑆𝑆𝑆 � ����� ���� �
, ��� organism, �
the 𝑆𝑆𝑡𝑡��� -internal
position
��
of � energy
the � �� of� a living
assemblage point �dr q-
�� , �a�gap in� the
on �the energy energy ��cocoon
cocoon of �a� living
a living � organism, r- W
q-inenergy
���
� � � � � ��
f(r, 𝑆𝑆 𝑡𝑡 �
-internal
� � � � ��
energy of a � living
� � organism, q- a gap the energy cocoon of a living organism
�a(𝐸𝐸 ))a agap
=𝑆𝑆𝑆𝑆
� � � � � �
�� �� �
�𝑆𝑆 �𝑡𝑡𝑆𝑆�𝑡𝑡� -internal
-internal � energy energy � ofenergy
of a�aliving
� living
� organism,
�a�organism,
, ��
-internal � � q- q-
energy gap � in
of inthe a the energy
living energy cocoon
cocoon
organism, ofofq-acocoon
aliving
qa- living
gap organism,
in organism,
the energy r-r-
gapcocoon ofr- a living organism, r-
the position of the assemblage � point � dr �on the energy cocoon of a living organism, W energy
prominences 𝑆𝑆 𝑡𝑡 -internal � � � of
𝑆𝑆 𝑡𝑡 living organism,
� q- a gap in the energy of a living organism,
a(𝐸𝐸�of))offrom the gapininthethe cocoon of a living of organism, E -external energy entering the
the position � the Eassemblage point dr on thethe energy cocoon of a living organism, Wq- ener
� � �
� � ��
thethepositionf(r,
prominences
position =𝑆𝑆𝑆𝑆
the theassemblage
from the gap
assemblage

point

cocoon
point � d�rd of� on aon the
living the energy
organism,
energy

cocoon q-external
cocoon ofofqcocoon
aenergy
aliving
living organism,
enteringorganism, gap W W q-q-energy
energy
in the the cocoon position of
��of
aa living the the
assemblage
organism, position r point
𝑡𝑡𝐸𝐸𝐸𝐸
𝐸𝐸𝐸𝐸𝑆𝑆prominences
� of
-internal
� the
-living d
a bundle
r assemblage
on from the
energy ofthe energy
offibers
point
of aof
gap inliving d r
external
the on
cocoon of the a
organism,
energy energy
living
ofentering cocoon
organism,
q- organism,
a gap in the
self-capacities,
a living of W a -living
energy organism,
energyenergy
Eq-external
q cocoon W - energy
of a livin
q
entering the g
�in the cocoon ofthe living organism, - aof bundle oforganism,

afibers external energy self-capacities,
��
prominences
prominences 𝑡𝑡�� -internal
𝑆𝑆prominences from
internal from the
energy
energy gap
from gapofin ainthe
of
the athe
living
prominences
gap cocoon
living cocoon
organism,
in of
organism, afrom
q-a alivinggap q-
the in organism,
gap
the
gap inthe
energy
in EqE
the -external
q-external
energy
cocoon
cocoon ofof aEenergy
cocoon energy
living
qa
of entering
aorganism,
�� organism,
living living the
r-thethe gapgap
organism,
position
E q-external r-
of thegap
assemblage
energy point drthe gap
entering
�collected
collected atatthe thepoint point ofassembly
of assembly ofthe ofthe
the the
incocoon cocoon
position
the cocoon cocoon
of a of
of
living a
a
ofthe living
living
a
organism. living organism,
assemblage
organism.
organism, point
���� W - energy prominences from the gap in ther cocoon of a living organism, E -external energy
-external
𝐸𝐸𝐸𝐸 d - aon energy
bundle the of entering
energy fibers ofthe
cocoon external of a living
energy organism
self-capaciti
ininthe theoncocoon
the cocoon
position
the
in energy
the ofofacocoon
cocoon ofaliving living
the ofof aorganism,
aorganism,
assemblageliving organism,
in theorganism,
living point
𝐸𝐸𝐸𝐸
cocoon 𝐸𝐸𝐸𝐸 - d-arof bundle
qaon bundle
aat�the� - of
living energy fibers
ofbundle fibers
organism, ofof
cocoon ofexternal
external
of��a of energy
aenergy
living
-cocoon bundle self-capacities,
self-capacities,
organism, of fibers Wself-capacities,
q-of energy
external E energy self-capacities,
da fibers external energy
prominencescollected 𝐸𝐸𝐸𝐸 the
from point the ofgap assembly 𝐸𝐸𝐸𝐸 ofof the cocoon aofentering
aself-capacities,
living organism.
ofinE the of living organism, q-external
at the pointenergy en
q
collected
collected entering
prominences at at the
the
the point
gappoint
from of
in𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
the
of assembly
the cocoon
assembly
gap ofof
in aof
the the
living the
cocoon cocoon
organism,
cocoon of of
a of a
Elaliving
living rliving a organism.
) - organism,
bundle
organism. fibers
-external external energyenergy the gap collected of
� collected
�𝑆𝑆

�� 𝑡𝑡� -- sample at � the
𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 point
�-program collected
of assembly
structure at the of
example. point
the cocoonof assembly of a livingof theq
cocoon
organism. of � a living organism.
� assembly
�𝑆𝑆in � 𝑡𝑡�the -- samplecocoonof the�cocoon of a living
𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 of a living
�-program organism, in organism.the𝐸𝐸𝐸𝐸cocoon
structure ��example.
- a bundle of a𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 living
of fibers organism,
of external � - a bundle of fibers of external energy s
𝐸𝐸𝐸𝐸energy self-capacities,
𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 � ��� �� � collected at the point of assembly of the cocoon of a living organism.
� �
� � collected
� �� � ������at
� � �
the point ����� , � �
of assembly � �
of𝑆𝑆 𝑡𝑡
the -- sample
cocoon of � a living �-program
organism. structure example.
��𝑆𝑆𝑡𝑡��𝑡𝑡�-- �sample
� , � � structure example.

�𝑆𝑆 �� --� � sample
�� �� ���� � ��������� , ��

� 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
�-program
�-program
��� �
� � ������
�structure
�--
� � � � example.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
�𝑡𝑡�� -- sample
�� 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 sample structure example. structure example.

�𝑆𝑆𝑆𝑆 ��𝑆𝑆�� � � 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 , ��� 𝑆𝑆 𝑡𝑡
�-program �

� � � can be�interpreted as a program � �-program
��� �� �� �� �
�𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
�� �𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 ���operator.
�� , �
� �
� � � � ������ �� ��� �� � �� ��
𝑆𝑆𝑆𝑆
� �� � � � � �
�� ��������� �� � ���
�� 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 ��, �
�, �� � � �
� �����𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
��� ��

�� � � can� be ��� � ��𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
interpreted as
, ��a� program ��� �� �
operator.

� ��� 𝑆𝑆
��𝑆𝑆��� 𝑡𝑡
��
𝑡𝑡�� �--
� ��
can �
�sample
�� �� be���interpreted
� , �
��
, ��
� �� ��� ���� as a � �-program��� ��
����, ��
�𝑆𝑆
structure
��� �𝑡𝑡
�-program� �
--

� �� sample
� � � example.
operator. � �� � � ����-program
� ���
� � ��, � � � � �
structure example.
�� 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜, ��𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
�� � � � �� �� �� �� �
� �� ������ � �� ��� �
�� 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠�
� � �
𝑆𝑆𝑆𝑆� ��be
� � � , �� �� 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 � can be interpreted as a program operator.
𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆

�� �𝑆𝑆 𝑡𝑡 �
� can be
� �� �� �� �
interpreted � � � as ��� a��� , �
can can
�-program

� interpreted
� �
be ��interpreted

� �� � operator. as as a aprogram
program operator.
operator.
� �can be interpreted ��� �as , �can
a𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
�programbe� interpreted operator. as a program operator.
� �� � � � � � �� � � � �
�𝑆𝑆𝑆𝑆 � � structure , ���𝑆𝑆𝑆𝑆 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
� � �
� � �� � � �
Consider �� examples hierarchical
� 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
��𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 �Set ��1-program �operator �
� � � � �� �� ���� �
can can be be interpreted
interpreted

��� �� � asas a a �𝑆𝑆���𝑡𝑡��� �can � � be
operator. �interpreted as a �� ��� ���-program
operator.
� operator.
�𝑆𝑆 �𝑆𝑆
� � �𝑡𝑡� 𝑡𝑡 𝑆𝑆 𝑓𝑓𝑓𝑓 � � �-program
��-program �
𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠��be �interpreted� , �� 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 �
�𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
a � becan a �as a program operator.
𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 �� � �
𝑆𝑆𝑆𝑆
1.���𝑆𝑆 𝑡𝑡� ����
�� � �
can beexamplesinterpreted � 𝑡𝑡as � can interpreted
1-programasoperator operator.
�, ��� �� �operator.
Consider � � structure 𝑆𝑆� 𝑡𝑡���� �𝑆𝑆hierarchical Set �-program �-program
����
�� 𝑆𝑆𝑆𝑆 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠

𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜 can be interpreted as a program operator.
� 𝑆𝑆𝑆𝑆��
as a � Consider structure examples hierarchical Set1-program operator
��𝑓𝑓𝑓𝑓 � �

1. �2.𝑆𝑆� 𝑡𝑡structure
Consider can��be𝑓𝑓� examples interpreted
exampleshierarchical �-program operator.
Consider
Consider
�� structure

��� ��� ���
structure
𝑆𝑆 𝑆𝑆𝑡𝑡 𝑡𝑡 � �. �,
examples
hierarchical
hierarchical �𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜Set � Set
Set 1-program
1-program
-program 𝑆𝑆 �� operator
𝑓𝑓𝑓𝑓
operator
operator 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
Consider ��
𝑆𝑆��� ��
𝑆𝑆��
�� 𝑓𝑓𝑓𝑓
��� � structure
𝑓𝑓𝑓𝑓� � �
Consider
examples 1. 𝑡𝑡� can
�𝑆𝑆hierarchical
�structure 1
� be examplesinterpreted
Set
�� 1-program �, hierarchicalas a
operator � Set1-program �-program operator operator.
1.1. � ���� 𝑆𝑆 �� � �,��
𝑓𝑓 �, ��
𝑆𝑆��simultaneous
���
𝑓𝑓𝑓𝑓Set1-program 𝑆𝑆 𝑡𝑡 ��� 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
2. Consider
Entire
��� 𝑆𝑆��� ���
𝑆𝑆structure
neural
��� 𝑆𝑆�� 𝑓𝑓𝑓𝑓
𝑡𝑡��𝑡𝑡�� network examples as instantaneous hierarchical ��� � �
operator
1.��� ���� ���
�� ��𝑆𝑆����𝑡𝑡 � �.���� ��� �,1. � ��� ��↓�↑� �����𝑆𝑆
�, � RAM
��
, �� 𝑓𝑓�
in Sit-elements and self-
𝑆𝑆 𝑆𝑆
��� ��
𝑓𝑓 𝑓𝑓 𝑆𝑆
� �� � 𝑓𝑓𝑓𝑓
… 𝑆𝑆 𝑡𝑡 2.� …𝑆𝑆 𝑡𝑡 ��
�� ��� , 𝑠𝑠𝑠𝑠𝑠𝑠𝑠� �.examples
…����
Consider �structure hierarchical Set1-program operator

2.2. 1.elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
���� � ,�f1 ↓ I ↑�� 𝑓𝑓� ��↓�↑ � , ����
� ����
����� ���� ��
�.
���
�� � � .When activated in a neural
network, ���� the
𝑆𝑆��� 𝑡𝑡 � � �.
entire ����� � �, network becomes 𝑆𝑆 ��a working
𝑓𝑓 ���𝑆𝑆 � 𝑡𝑡�
��� �𝑆𝑆 � 𝑡𝑡𝑆𝑆𝑆𝑆 𝑡𝑡 𝑓𝑓
neural �� � �� memory. Use of self-energy as activation
Entire2. neural ������ � ����� � �
� ����� network ���. ����2. instantaneous
as � ��� � �. 𝑆𝑆�� 𝑓𝑓𝑓𝑓
simultaneous� ���� �� RAM � ���� in Sit-elements and self-
→1.
������������
or from outside. 𝑆𝑆�� ��� 𝑓𝑓Q�…�0���� 𝑡𝑡�� �����������
𝑆𝑆=�𝑆𝑆𝑆𝑆 self-RAM,
Entire
��� 𝑆𝑆��Q 𝑡𝑡��� = ����������
neural
�00��↓�↑ �� � ,
network
��� 𝑄𝑄�,� , Q01= �����
as 𝑄𝑄� .
instantaneous simultaneous RAM in Sit-elements and se
Entire
Entire 2. neural
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 neural � ��� network
network
���� �. ��as ����
↓ Iinstantaneous
as ↑instantaneous
� �
��↓�↑�� ��simultaneous …
𝑆𝑆� 𝑡𝑡�, ��𝑠𝑠𝑠𝑠𝑠𝑠𝑠RAM
, simultaneous �� �����
RAM
���� … ����
inin.When
������������
Sit-elements
Sit-elements and in��,a self-
� and self-
𝑆𝑆� 𝑡𝑡�� , f1 �� 𝑓𝑓� in eprograms, ��� activated neural
���������� ����������
Q0,Q00,Q01��� -coding,translation,realization ��� use
�� ����� Q ,Q
����
�, …0 memory. ,Q
00 01 mnSt -S ,Assembler. ��↓�↑��� �� ,… as
��↓�↑ ��
����…
����
network, Entire the���� entire…����
neural …���� neural network network
Entire
� � as ��↓�↑becomes
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
neural � �� ,…��↓�↑
instantaneous a𝑆𝑆��
…��↓�↑ working
network ��𝑓𝑓�, �
as
simultaneous ,
����f1 ↓
… ����
instantaneous Use
…I����↑ � of self-energy
𝑓𝑓
RAM simultaneous
in Sit-elements activation
, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠
RAM and in .When activated
Sit-elements
self- andin self-
a neu
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 ���� , f1, f1↓ ↓�I���� ↑I ��↑��𝑓𝑓�𝑓𝑓2. �
��↓�↑ �� �� � �
�� , �� �, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠
, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠
�.
���� .When
�� .When �
�activated
activatedinina aneural neural
������ network, ���the entire � neural
� � ,��network becomes
�����
�� ���� � a working memory. Use of self-energy as activat
or Entire
network,
network, the theneural
entire
entire Qneural network
0neural 𝑆𝑆𝑆𝑆 …networknetwork as becomes instantaneous
becomes a��↓�↑working
a��� working 𝑆𝑆simultaneous
�,�𝑡𝑡= �memory.
�� �� Use
↓memory.
RAM
𝑄𝑄Use , Qof01 �in
�self-energy
of … Sit-elements
=self-energy �� asas activation
activation and … self-
���� ��↓�↑ ��↓�↑
���� � , ����
from outside.
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 =���� , f1 ↓→
����������
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 I ↑self-RAM,
� ���� … �Q
��00 � …����������
,f1 �I����↑�� ��↓�↑
,����������
𝑓𝑓 ���� …����������
� ,�����.When 𝑄𝑄�, .𝑠𝑠𝑠𝑠𝑠𝑠𝑠

activated ����
neural activated
in�� a .When in a neural
Declarations �� 𝑓𝑓� � 𝑠𝑠𝑠𝑠𝑠𝑠𝑠
����� ����� �����
��
����� ��
��� ����� ��↓�↑� ������
� , ���� ��� ����� ������������
oror from Availability
network,
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
outside. of
Q the Data
���� and
=

entire
����
���� ����
,Material
����������
network,
neural
f1 ↓ I
→ ↑ -
network
� or the
𝑓𝑓
self-RAM, from
��↓�↑entire outside.
becomes
�� Q � ,…
� neural
=
��
aQ =
� ����
����������
working
0
,𝑆𝑆𝑆𝑆
network
�� ��
𝑠𝑠𝑠𝑠𝑠𝑠𝑠 , becomes
memory.
����
Q

= →
����
�� �� self-RAM,
��������������
a
Use
.When working
of Q
self-energy
activated
. 00 =
memory.
����������
in aas Use
neural 𝑄𝑄 of,
activationQ =
self-energy
01 as �.
𝑄𝑄activation
Q0from outside. Q0 0= 𝑆𝑆𝑆𝑆 � �
𝑆𝑆𝑆𝑆 → ��self-RAM, Q
0000= � �use Q 𝑄𝑄 ,Q 01=-S 𝑄𝑄� �.

���������� ���������� ����������
,Q 00,Q
Competing 01-coding,translation,realization
Interest ����
����������
� in eprograms,
���������� �
𝑄𝑄
,Q
����
��0����������
� �00 ,Q
0101
����������
mnSt
���������� 𝑄𝑄
,Assembler. � ���� ��
� ����
������������
network,
There are no thecompetingentire neural
��������
����������
���������� network
��All Entire
�����
Q0becomes
,Q neural
of,Q a working network
����������
��
����� ����
-coding,translation,realization
����������
��
����memory. �� as �����instantaneous
��
Use of self-energy
������������ �����
������������ in eprograms,
�simultaneous
����������
as activation
����
���������� use Q0,Q00,Q����������
������������ �� ��RAM
����� in Sit-elemen
01-SmnSt,Assembler.
QQ 0,Q0,Q 0000 ,Q or,Q 01from
01 outside. Qinterests.
-coding,translation,realization
-coding,translation,realization 0= or 𝑆𝑆𝑆𝑆 from
�����
�� �� �����
sections
����������
outside. in →
in00 the
Q 01article
self-RAM,
eprograms,
eprograms,
0 = 𝑆𝑆𝑆𝑆 are
use
� useexecuted
Q
����������
���� Q00Q0=
�,Q
0 ,Q → jointly.
,Q
����������
���� 00 00��� self-RAM,
,Q01 -S
01 -SmnSt𝑄𝑄
mnSt� , Q Q
,Assembler. =
,Assembler.
01
� 00
���� = ����� ��↓�↑
� � 𝑄𝑄 �
� .
𝑄𝑄 �
, , Q 01 = � 𝑄𝑄
…���� �
.
���� …����
������������ ���������� �������
������������
��↓�↑��� ,…𝑄𝑄����
������������
����������� ���� � �� ����
����
or from outside. Q0= 𝑆𝑆𝑆𝑆 �����������
Declarations
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠
���������� → self-RAM, Q 00= , f1
����� ↓
���������� I𝑄𝑄
�� Q��
↑� , Q 𝑓𝑓
01 =
� �� �����
� � . , 𝑠𝑠𝑠𝑠𝑠𝑠𝑠 ���������� .When activa
Q0,Q00,Q01-coding,translation,realization �� 0,Q00,Q01-coding,translation,realization
Q����������
����
in eprograms, use 0in
,Q00 eprograms,
,Q���������� use Q0,Q00,Q01-SmnSt,Assembler.
01-SmnSt,Assembler.
Availability
Q0,Q00,Q01of
J Sen Net Data Data and Material -Declarations
Comm, 2023
-coding,translation,realization network, the entire
in eprograms, use Q neural
����������
network becomes
0,Q00,Q01-SmnSt,Assembler.
a working memory. Volume 3Use | Issueof self-energy
1 | 142
Declarations
Declarations ����� ����� �����
Competing Interest
- - Availability of Data and��Material ����������-
�� ������������
Availability
AvailabilityofofData Dataand andMaterial Material or from outside. Q 0 = 𝑆𝑆𝑆𝑆 → self-RAM, Q 00 = ����������
𝑄𝑄 , Q 01 = 𝑄𝑄
ThereDeclarations are no competing interests. Declarations AllCompeting sections of Interest the article are �executed
���� jointly. ����� � �����
Competing
Competing Interest
Interest ������������ �� ��
Declarations Availability Thereofare no competing interests. All sections of the article ���������� are executed jointly. ����������
There
There are Availability
arenonocompeting competing of Data interests.
interests. andAll Material
Q0sections
All ,Q 00,Q-Data
sections ofof
01 the the and
article
article Material
-coding,translation,realization are areexecuted -
executed jointly. in eprograms, use Q0,Q00,Q01-SmnSt,Assem
jointly.
𝑆𝑆�� 𝑓𝑓𝑓𝑓
1. � ��� ��� �,
���𝑆𝑆� 𝑡𝑡�
�� �
𝑆𝑆�� 𝑓𝑓�
2. � ��� � �.
���𝑆𝑆� 𝑡𝑡�

Entire neural network as instantaneous simultaneous RAM in Sit-elements and self-


���� � ��↓�↑�
�� �� , …����
����… …
elements.𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 , f1 ↓ I ↑��� 𝑓𝑓� ��↓�↑���� ,
, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠���� .When activated in a neural
network, the entire neural network becomes a working memory. Use of self-energy as activation
����� ����� �����
������������ �� ������������
or from outside. Q0= 𝑆𝑆𝑆𝑆 �����
→ self-RAM, Q00= ����������
����� 𝑄𝑄� , Q01= �����
𝑄𝑄� .
������������ ����������
�� ������������
Q0,Q00,Q01-coding,translation,realization in eprograms, use Q0,Q00,Q01-SmnSt,Assembler.

Declarations 2.
Danilishyn І.V. Danilishyn O.V. tS – ELEMENTS. Collec-
Declarations
Availability of Data and Material - tion of scientific papers «ΛΌГOΣ» with Proceedings of the
Competing Interest
Availability of Data and Material - V International Scientific and Practical Conference, Oxford,
There areCompeting
no competingInterest
interests. All sections of the article are June 23, 2023. Oxford-Vinnytsia: P.C. Publishing House &
executed jointly. European Scientific Platform, 2023.Theoretical and empiri-
There are no competing interests. All sections of the article are executed jointly.
cal scientific research: concept and trends. pp.156-161, DOI
Funding 10.36074/logos-23.06.2023.42.
There were no sources of funding for writing the article. 3. Danilishyn, I., & Danilishyn, O. (2023). VARIABLE HIER-
ARCHICAL DYNAMICAL STRUCTURES (MODELS)
Authors' Contributions FOR DYNAMIC, SINGULAR, HIERARCHICAL SETS
The contribution of the authors is the same, we will not separate. AND THE PROBLEM OF COLD THERMONUCLEAR FU-
SION. Collection of scientific papers «SCIENTIA», (July 14,
Acknowledgements 2023; Coventry, UK), 113-119.
We are grateful to our academic supervisor scientific director: 4. Danilishyn І.V. Danilishyn O.V. SET1 – ELEMENTS. IN-
Volodymyr Pasynkov PhD of physic-mathematical science, TERNATIONAL SCIENTIFIC JOURNAL GRAIL OF SCI-
assistant professor of applied mathematics and calculated ENCE № 28 June, 2023 with the proceedings of the:Corre-
techniques department of “National Metallurgical Academy” spondence International Scientific and Practical Conference
(Ukraine) for guidance and assistance in writing this article. SCIENCE IN MOTION: CLASSIC AND MODERN TOOLS
AND METHODS IN SCIENTIFIC INVESTIGATIONS held
References on June 9 th, 2023 by NGO European Scientific Platform
1. Danilishyn, I., Danilishyn, O., & Pasynkov, V. (2023). THE (Vinnytsia, Ukraine) LLC International Centre Corporative
USAGE OF SIT-ELEMENTS FOR NETWORKS. Collec- Management (Vienna, Austria), pp. 239-254.
tion of scientific papers «ΛΌГOΣ», (March 31, 2023; Zurich,
Switzerland), 129-134.

Copyright: ©2023 Illia Danilishyn, et al. This is an open-access article


distributed under the terms of the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any
medium, provided the original author and source are credited.

J Sen Net Data Comm, 2023 https://opastpublishers.com/ Volume 3 | Issue 1 | 143

You might also like