Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Krupskii V.N., Plisko V.E., Teoriya algoritmov, Izdatelskii tsentr “Akademiya”, M., 2009
[2] Uspenskii V.A., Lektsii o vychislimykh funktsiyakh, Fizmatgiz, M., 1960
[3] Specker E., “Nicht konstructiv beweisbare Saetze der Analysis”, J. Symbol. Logic., 14:3 (1949), 145–158 | DOI | MR | Zbl
[4] Pour-El M.B., Richards J.I., Computability in Analysis and Physics, Springer-Verlag, Berlin–Heidelberg, 1989 | MR | Zbl
[5] Henrici P., Discrete variable methods in ordinary differential equations, Wiley, N.Y., 1962 | MR | Zbl
[6] Pour-El M.B., Richards J.I., “A computable ordinary differential equation which possesses no computable solution”, Ann. Math. Log., 17 (1979), 61–90 | DOI | MR | Zbl
[7] Bylov B.F., Vinograd R.E., Grobman D.M., Nemytskii V.V., Teoriya pokazatelei Lyapunova, Nauka, M., 1966