Constructivization in pattern recognition
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2008), pp. 188-193
Cet article a éte moissonné depuis la source Math-Net.Ru
The problems of solvability and computability are investigated, which define the concept of constructivization in pattern recognition problem.
@article{VUU_2008_2_a62,
author = {N. I. Kalyadin},
title = {Constructivization in pattern recognition},
journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
pages = {188--193},
year = {2008},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VUU_2008_2_a62/}
}
N. I. Kalyadin. Constructivization in pattern recognition. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2008), pp. 188-193. http://geodesic.mathdoc.fr/item/VUU_2008_2_a62/
[1] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Problemy kibernetiki, no. 33, Nauka, M., 1978, 5–69
[2] Kalyadin N. I., “Konstruktivizatsiya modelei klassifikatsii konechnykh ob'ektov”, Izvestiya instituta matematiki i informatiki UdGU. Izhevsk, 2007, no. 1(38), 3–231
[3] Katlend N., Vychislimost. Vvedenie v teoriyu rekursivnykh funktsii, Mir, M., 1983, 256 pp. (Per. s angl.) | MR
[4] Rodzhers Kh., Teoriya rekursivnykh funktsii i effektivnaya vychislimost, Mir, M., 1972, 624 pp. (Per. s angl.) | MR