Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Matiyasevich Yu.V., “Algoritm Tarskogo”, Kompyuternye instrumenty v obrazovanii, 2008, no. 6, 4–14
[2] Matiyasevich Yu.V., Desyataya problema Gilberta, Fizmatlit, M., 1993 | MR
[3] Adler A., “Some recursively unsolvable problems in analysis”, Proc. Amer. Math. Soc., 22:2 (1969), 523–526 | DOI | MR | Zbl
[4] Wang P., “The undecidability of the existence of zeros of real elementary functions”, J. ACM, 21:4 (1974), 586–589 | DOI | MR | Zbl
[5] Richardson D., “Some undecidable problems involving elementary functions od a real variable”, J. Symbol. Log., 33:4 (1968), 514–520 | DOI | MR | Zbl
[6] Gashkov S.B., “Slozhnost realizatsii bulevykh funktsii skhemami iz funktsionalnykh elementov i formulami v bazisakh, elementy kotorykh realizuyut nepreryvnye funktsii”, Problemy kibernetiki, 37, Nauka, M., 1980, 57–118
[7] Turan G., Vatan F., “On the computation of Boolean functions by analog circuit of bounded fan-in”, J. Computer and System Sci., 54:1 (1997), 199–212 | DOI | MR | Zbl
[8] Gashkov S. B., Vegner Ya.V., “O slozhnosti realizatsii bulevykh funktsii veschestvennymi formulami”, Matem. zametki, 92:2 (2012), 181–191 | DOI | Zbl
[9] Gashkov S. B., Vegner Ya.V., “O slozhnosti priblizhennoi realizatsii lipshitsevykh funktsii skhemami v kontinualnykh bazisakh”, Matem. zametki, 92:1 (2012), 27–43 | DOI | Zbl