|
|
|
|
References
|
|
| |
| 1. |
Gashkov S. B., Chubarikov V. N., Arifmetika. Algoritmy. Slozhnost vychislenii, Vyssh. shkola, M., 2000 |
| 2. |
Yakobson A., Buch G., Rambo Dzh., Unifitsirovannyi protsess razrabotki programmnogo obespecheniya, Piter, SPb., 2002 |
| 3. |
Bull J. M., Smith L. A., Pottage L., Freeman R., “Benchmarking Java against C and Fortran for scientific applications”, Proc. ACM 2001 Java Grande Conf., ACM, Stanford, 2001, 97–105 |
| 4. |
Keisler G., Chen Ch. Ch., Teoriya modelei, Mir, M., 1977  |
| 5. |
Tarskii A., Vvedenie v logiku i metodologiyu deduktivnykh nauk, IP “TRIVIUM”, Birobidzhan, 2000 |
| 6. |
Bauer F. L., Gooz G., Informatika. Vvodnyi kurs, 1, 2, Mir, M., 1990 |
| 7. |
Yablonskii S. V., “Vvedenie v teoriyu funktsii $k$-znachnoi logiki”, Diskretnaya matematika i matematicheskie voprosy kibernetiki, T. 1, Nauka, M., 1974 |
| 8. |
Kahan W., Lecture Notes on the Status of IEEE Standard 754 for Binary
Floating-Point Arithmetic, http://www.cs.berkeley.edu/? wkahan/ieee754-status/IEEE754.pdf, Berkeley, 1996 |
| 9. |
Pratt T., Zelkovits M., Yazyki programmirovaniya: razrabotka i realizatsiya, Piter, SPb., 2002 |
| 10. |
TMS320C3x General-Purpose Applications User's Guide. Texas Instruments, http://www-s.ti.com/sc/psheets/spru194/spru194.pdf, 1998 |
| 11. |
Kleschev A. S., Artemeva I. L., “Neobogaschennye sistemy logicheskikh otnoshenii. Ch. 1”, NTI. Ser. 2, 7, 2000, 18–28 |
| 12. |
Kleschev A. S., Artemeva I. L., “Neobogaschennye sistemy logicheskikh otnoshenii. Ch. 2”, NTI. Ser. 2, 8, 2000, 8–18 |
| 13. |
Minskii M., Freimy dlya predstavleniya znanii, Energiya, M., 1979 |
