𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the correctness of a linear closure of set of recognition algorithms of the decision tree type

✍ Scribed by V. I. Donskoi

Publisher
Springer US
Year
1993
Tongue
English
Weight
198 KB
Volume
65
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The synthesis of correct algorithms in t
The synthesis of correct algorithms in the closure of recognition algorithms with representative samples and systems of supporting sets
✍ A.E. Dyusembaev πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science βš– 435 KB

In our case, where c>0 is a constant; therefore, form (3.9) we have 2 \_-c 2 II Vll~,co,--~ IIFIl~,co,[I VlL, c~,+ll Vll~,~,,, or, passing to V and U, [i UII=~r IIFII~,r Uil~r II Uil,2,w,~. S 9 iO) 2. Let us consider the Weyl functions. The functions of the Weyl sequence satisfy the system of equati