𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximative versions of Kolmogorov's superposition theorem, proved constructively

✍ Scribed by Manuela Nees

Book ID
107989088
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
992 KB
Volume
54
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational aspects of Kolmogorov's su
Computational aspects of Kolmogorov's superposition theorem
✍ Hidefumi Katsuura; David A. Sprecher πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 454 KB

This paper continues the investigation of representations of continuous functions f( X 1 ..... Xn) with n .... > 2 in the form f( x~, , Xn ) = ~ q=O2n Xqt a~ f z\_,S" P=n I Xp ~b( Xp + qe,) ] with a predetermined function ~b that is independent of n. The fimction ~k is defined through its graph that

A constructive version of Birkhoff's the
A constructive version of Birkhoff's theorem
✍ Jesper CarlstrΓΆm πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

## Abstract A version of Birkhoff's theorem is proved by constructive, predicative, methods. The version we prove has two conditions more than the classical one. First, the class considered is assumed to contain a generic family, which is defined to be a set‐indexed family of algebras such that if