This article has multiple issues. Please helpimprove it or discuss these issues on thetalk page.(Learn how and when to remove these messages) This article'slead sectionmay be too short to adequatelysummarize the key points. Please consider expanding the lead toprovide an accessible overview of all important aspects of the article.(May 2011) This articlemay be too technical for most readers to understand. Pleasehelp improve it tomake it understandable to non-experts, without removing the technical details.(January 2022) (Learn how and when to remove this message) This articleneeds attention from an expert in Computing. The specific problem is:This needs the help of somebody who can read Kartsev's papers and understand them.WikiProject Computing may be able to help recruit an expert.(August 2025) (Learn how and when to remove this message)

Withincomputer engineering andcomputer science, acomputer for operations with (mathematical) functions (unlike the usualcomputer) operates withfunctions at thehardware level (i.e. without programming these operations).^[1][2][3]

A computing machine for operations with functions was presented and developed by Mikhail Kartsev in 1967.^[1] Among the operations of this computing machine were the functions addition, subtraction and multiplication, functions comparison, the same operations between a function and a number, finding the function maximum, computingindefinite integral, computingdefinite integral ofderivative of two functions, derivative of two functions, shift of a function along the X-axis etc. By itsarchitecture this computing machine was (using the modern terminology) avector processor orarray processor, acentral processing unit (CPU) that implements an instruction set containing instructions that operate onone-dimensional arrays of data calledvectors. In it there has been used the fact that many of these operations may be interpreted as the known operation on vectors: addition and subtraction of functions - as addition and subtraction of vectors, computing a definite integral of two functions derivative— as computing the vector product of two vectors, function shift along the X-axis – as vector rotation about axes, etc.^[1] In 1966 Khmelnik had proposed a functions coding method,^[2] i.e. the functions representation by a "uniform" (for a function as a whole) positional code. And so the mentioned operations with functions are performed as unique computer operations with such codes on a "single"arithmetic unit.^[3]

Source:^[2][3]

The positional code of an integer number${\displaystyle A}$ is a numeral notation of digits${\displaystyle \alpha }$ in a certainpositional number system of the form

${\displaystyle A={\alpha }_0{\alpha }_1\dots {\alpha }_k\dots {\alpha }_n}$.

Such code may be called "linear". Unlike it a positional code of one-variable${\displaystyle x}$ function${\displaystyle F(x)}$ has the form:

and so it isflat and "triangular", as the digits in it comprise a triangle.

The value of the positional number${\displaystyle A}$ above is that of the sum

${\displaystyle A=\sum _{k=0}^n{\alpha }_k{\rho }^k}$,

where${\displaystyle \rho }$ is the radix of the said number system. The positional code of a one-variable function correspond to a 'double' code of the form

${\displaystyle F(x)=\sum _{k=0}^n\sum _{m=0}^k{\alpha }_{mk}{R}^k{y}^{k-m}(1-y{)}^m}$,

where${\displaystyle R}$ is an integer positive number, quantity of values that taken${\displaystyle \alpha }$, and${\displaystyle y}$ is a certain function of argument${\displaystyle x}$.

Addition of positional codes of numbers is associated with thecarry transfer to a higher digit according to the scheme

${\displaystyle {\alpha }_k⟶{\alpha }_{k+1}}$.

Addition of positional codes of one-variable functions is also associated with the carry transfer to higher digits according to the scheme:

.

Here the same transfer is carried simultaneously totwo higher digits.

A triangular code is calledR-nary (and is denoted as${\displaystyle T{K}_R}$), if the numbers${\displaystyle {\alpha }_{mk}}$ take their values from the set

${\displaystyle D_R=\{-r_1,-r_1+1,\dots ,-1,0,1,\dots ,r_2-1,r_2\}}$, where${\displaystyle r_1,r_2\ge 0}$ and${\displaystyle R_{}^{}=r_1+r_2+1}$.

For example, a triangular code is a ternary code${\displaystyle T{K}_3}$, if${\displaystyle {\alpha }_{mk}\in (-1,0,1)}$, and quaternary${\displaystyle T{K}_4}$, if${\displaystyle {\alpha }_{mk}\in (-2,-1,0,1)}$.
ForR-nary triangular codes the following equalities are valid:

,

where${\displaystyle a}$ is an arbitrary number. There exists${\displaystyle T{K}_R}$ of an arbitrary integerreal number. In particular,${\displaystyle T{K}_R(\alpha )=\alpha }$. Also there exists${\displaystyle T{K}_R}$ of any function of the form${\displaystyle y^k}$. For instance,${\displaystyle T{K}_R(y^2)=(001)}$.

in R-nary triangular codes consists in the following:

• in the given${\displaystyle (mk)}$-digit there is determined the sum${\displaystyle S_{mk}^{}}$ of the digits that are being added${\displaystyle {\alpha }_{mk},{\beta }_{mk}}$ and two carries${\displaystyle p_{m,k-1},p_{m-1,k-1}}$, transferred into this digit from the left, i.e.

${\displaystyle S_{mk}^{}={\alpha }_{mk}+{\beta }_{mk}+p_{m,k-1}+p_{m-1,k-1}}$,

• this sum is presented in the form${\displaystyle S_{mk}^{}={\sigma }_{mk}+R{p}_{mk}}$, where${\displaystyle {\sigma }_{mk}\in D_R}$,
• ${\displaystyle {\sigma }_{mk}}$ is written in the${\displaystyle (mk)}$-digit of summary code, and the carry${\displaystyle p_{mk}}$ from the given digit is carried into${\displaystyle (m,k+1)}$-digit and${\displaystyle (m+1,k+1)}$—digit.

This procedure is described (as also for one-digit addition of the numbers) by a table of one-digit addition, where all the values of the terms${\displaystyle {\alpha }_{mk}\in D_R}$ and${\displaystyle {\beta }_{mk}\in D_R}$ must be present and all the values of carries appearing at decomposition of the sum${\displaystyle S_{mk}^{}={\sigma }_{mk}+R{p}_{mk}}$. Such a table may be synthesized for${\displaystyle R>2.}$
Below we have written the table of one-digit addition for${\displaystyle R=3}$:

Smk	TK(Smk)		${\displaystyle {\sigma }_{mk}^{}}$	${\displaystyle p_{mk}^{}}$
.	.	0	.	.
0	0	0	0	0
.	.	0	.	.
1	1	0	1	0
.	.	0	.	.
(-1)	(-1)	0	(-1)	0
.	.	1	.	.
2	(-1)	1	(-1)	1
.	.	1	.	.
3	0	1	0	1
.	.	1	.	.
4	1	1	1	1
.	.	(-1)	.	.
(-2)	1	(-1)	1	(-1)
.	.	(-1)	.	.
(-3)	0	(-1)	0	(-1)
.	.	(-1)	.	.
(-4)	(-1)	(-1)	(-1)	(-1)

in R-nary triangular codes differs from the one-digit addition only by the fact that in the given${\displaystyle (mk)}$-digit the value${\displaystyle S_{mk}^{}}$ is determined by the formula

${\displaystyle S_{mk}^{}={\alpha }_{mk}-{\beta }_{mk}+p_{m,k-1}+p_{m-1,k-1}}$.

in R-nary triangular codes is based on using the correlation:

,

from this it follows that the division of each digit causes carries into two lowest digits. Hence, the digits result in this operation is a sum of the quotient from the division of this digit by R and two carries from two highest digits. Thus, when divided by parameter R

• in the given${\displaystyle (mk)}$-digit the following sum is determined

${\displaystyle S_{mk}^{}={\alpha }_{mk}/R-p_{m+1,k}/R+p_{m+1,k+1}}$,

• this sum is presented as${\displaystyle S_{mk}^{}={\sigma }_{mk}+p_{mk}/R}$, where${\displaystyle {\sigma }_{mk}\in D_R}$,
• ${\displaystyle {\sigma }_{mk}}$ is written into${\displaystyle (mk)}$—digit of the resulting code, and carry${\displaystyle p_{mk}}$ from the given digit is transferred into the${\displaystyle (m-1,k-1)}$-digit and${\displaystyle (m-1,k)}$-digit.

This procedure is described by the table of one-digit division by parameter R, where all the values of terms and all values of carries, appearing at the decomposition of the sum${\displaystyle S_{mk}^{}={\sigma }_{mk}+p_{mk}/R}$, must be present. Such table may be synthesized for${\displaystyle R>2.}$
Below the table will be given for the one-digit division by the parameter R for${\displaystyle R=3}$:

Smk	TK(Smk)		${\displaystyle {\sigma }_{mk}^{}}$	${\displaystyle p_{mk}^{}}$
.	.	0	.	.
0	0	0	0	0
.	.	1	.	.
1	0	0	1	0
.	.	(-1)	.	.
(-1)	0	0	(-1)	0
.	.	0	.	.
1/3	1	(-1/3)	0	1
.	.	1	.	.
2/3	(-1)	1/3	1	(-1)
.	.	1	.	.
4/3	1	(-1/3)	1	1
.	.	2	.	.
5/3	(-1)	1/3	2	(-1)
.	.	0	.	.
(-1/3)	(-1)	1/3	0	(-1)
.	.	(-1)	.	.
(-2/3)	1	(-1/3)	(-1)	1
.	.	(-1)	.	.
(-4/3)	(-1)	1/3	(-1)	(-1)
.	.	(-2)	.	.
(-5/3)	1	(-1/3)	(-2)	1

of R-nary triangular codes consists (as in positional codes of numbers) in subsequently performed one-digit operations. Mind that the one-digit operations in all digits of each column are performed simultaneously.

of R-nary triangular codes. Multiplication of a code${\displaystyle T{K}_R^{\prime }}$ by${\displaystyle (mk)}$-digit of another code${\displaystyle T{K}_R^{″}}$ consists in${\displaystyle (mk)}$-shift of the code${\displaystyle T{K}_R^{\prime }}$, i.e. its shift k columns left and m rows up. Multiplication of codes${\displaystyle T{K}_R^{\prime }}$ and${\displaystyle T{K}_R^{″}}$ consists in subsequent${\displaystyle (mk)}$-shifts of the code${\displaystyle T{K}_R^{\prime }}$ and addition of the shifted code${\displaystyle T{K}_R^{\prime }}$ with the part-product (as in the positional codes of numbers).

of R-nary triangular codes. The derivative of function${\displaystyle F(x)}$, defined above, is

${\displaystyle \frac{\mathrm{\partial }F(x)}{\mathrm{\partial }x}=\frac{\mathrm{\partial }y}{\mathrm{\partial }x}\frac{\mathrm{\partial }F(x)}{\mathrm{\partial }y}}$.

So the derivation of triangular codes of a function${\displaystyle F(x)}$ consists in determining the triangular code of the partial derivative${\displaystyle \frac{\mathrm{\partial }F(x)}{\mathrm{\partial }y}}$ and its multiplication by the known triangular code of the derivative${\displaystyle \frac{\mathrm{\partial }y}{\mathrm{\partial }x}}$. The determination of the triangular code of the partial derivative${\displaystyle \frac{\mathrm{\partial }F(x)}{\mathrm{\partial }y}}$ is based on the correlation

.

The derivation method consists of organizing carries from mk-digit into (m+1,k)-digit and into (m-1,k)-digit, and their summing in the given digit is performed in the same way as in one-digit addition.

of R-nary triangular codes. A function represented by series of the form

${\displaystyle F(x)=\sum _{k=0}^n{A}_k{y}^k}$,

with integer coefficients${\displaystyle A_k}$, may be represented by R-nary triangular codes, for these coefficients and functions${\displaystyle y^k}$ have R-nary triangular codes (which was mentioned in the beginning of the section). On the other hand, R-nary triangular code may be represented by the said series, as any term${\displaystyle {\alpha }_{mk}{R}^k{y}^k(1-y{)}^m}$ in the positional expansion of the function (corresponding to this code) may be represented by a similar series.

of R-nary triangular codes. This is the name of an operation of reducing the number of "non"-zero columns. The necessity of truncation appears at the emergence of carries beyond the digit net. The truncation consists in division by parameter R. All coefficients of the series represented by the code are reduced R times, and the fractional parts of these coefficients are discarded. The first term of the series is also discarded. Such reduction is acceptable if it is known that the series of functions converge. Truncation consists in subsequently performed one-digit operations of division by parameter R. The one-digit operations in all the digits of a row are performed simultaneously, and the carries from lower row are discarded.

R-nary triangular code is accompanied by a scale factor M, similar to exponent for floating-point number. Factor M permits to display all coefficients of the coded series as integer numbers. Factor M is multiplied by R at the code truncation. For addition factors M are aligned, to do so one of added codes must be truncated. For multiplication the factors M are also multiplied.

Source:^[4]

Positional code for function of two variables is depicted on Figure 1. It corresponds to a "triple" sum of the form::${\displaystyle F(x,v)=\sum _{k=0}^n\sum _{m1=0}^k\sum _{m2=0}^k{\alpha }_{m1,m2,k}{R}^k{y}^{k-m1}(1-y{)}^{m1}{z}^{k-m2}(1-z{)}^{m2}}$,
where${\displaystyle R}$ is an integer positive number, number of values of the figure${\displaystyle {\alpha }_{m1,m2,k}}$, and${\displaystyle y(x),z(v)}$ — certain functions of arguments${\displaystyle x,v}$ correspondingly. On Figure 1 the nodes correspond to digits${\displaystyle {\alpha }_{m1,m2,k}}$, and in the circles the values of indexes${\displaystyle m1,m2,k}$ of the corresponding digit are shown. The positional code of the function of two variables is called "pyramidal". Positional code is called R-nary (and is denoted as${\displaystyle P{K}_R}$), if the numbers${\displaystyle {\alpha }_{m1,m2,k}}$ assume the values from the set${\displaystyle D_R}$. At the addition of the codes${\displaystyle P{K}_R}$ the carry extends to four digits and hence${\displaystyle R\ge 7}$.

A positional code for the function from several variables corresponds to a sum of the form

${\displaystyle F(x_1,\dots ,x_i,\dots ,x_a)=\sum _{k=0}^n\sum _{m_1=0}^k\dots \sum _{m_a=0}^k({\alpha }_{m_1,\dots ,m_a,k}{R}^k\prod _{i=1}^a(y_i^{k-m_i}(1-y_i{)}^{m_i}))}$,

where${\displaystyle R}$ is an integer positive number, number of values of the digit${\displaystyle {\alpha }_{m_1,\dots ,m_a,k}}$, and${\displaystyle y_i(x_i)}$ certain functions of arguments${\displaystyle x_i}$. A positional code of a function of several variables is called "hyperpyramidal". Of Figure 2 is depicted for example a positional hyperpyramidal code of a function of three variables. On it the nodes correspond to the digits${\displaystyle {\alpha }_{m1,m2,m3,k}}$, and the circles contain the values of indexes${\displaystyle m1,m2,m3,k}$ of the corresponding digit. A positional hyperpyramidal code is called R-nary (and is denoted as${\displaystyle GP{K}_R}$), if the numbers${\displaystyle {\alpha }_{m_1,\dots ,m_a,k}}$ assume the values from the set${\displaystyle D_R}$. At the codes addition${\displaystyle GP{K}_R}$ the carry extends ona-dimensional cube, containing${\displaystyle 2^a}$ digits, and hence${\displaystyle R\ge (2^{a-1}-1)}$.

• Hardware acceleration
• Digital signal processor

• Encodings
• Central processing unit
• Soviet inventions
• One-of-a-kind computers

• CS1 Russian-language sources (ru)
• Wikipedia introduction cleanup from May 2011
• All pages needing cleanup
• Articles covered by WikiProject Wikify from May 2011
• All articles covered by WikiProject Wikify
• Wikipedia articles that are too technical from January 2022
• All articles that are too technical
• Articles needing expert attention from August 2025
• All articles needing expert attention
• Computing articles needing expert attention
• Articles with multiple maintenance issues