RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025 Number 2, Pages 88–90 (Mi vmumm4679)

Short notes

Criteria of expressibility of CPL-functions in generalized bases

V. G. Shishlyakov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: In the paper, circuits obtained by superpositions over bases consisting of arbitrary subsets of particle-linear functions are studied, and criteria for the expressibility of an arbitrary particle-linear continuous function over such bases is proved. Estimates of the linear complexity and nonlinear dependence of the resulting circuits are given.

Key words: neural circuits, finitely parallel functions, expressibility of functions by neural circuits, nonlinear complexity, nonlinear depth.

UDC: 519.95

Received: 22.12.2023

DOI: 10.55959/MSU0579-9368-1-66-2-15


 English version:
Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 2025, 80:2, 148–150

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026