Constructivization in pattern recognition
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2008), pp. 188-193
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The problems of solvability and computability are investigated, which define the concept of constructivization in pattern recognition problem.
[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