Error-free computation with finite number systems
暂无分享,去创建一个
Since an automatic digital computer is a finite machine, it is capable of representing, internally, only a finite set of numbers. Thus, any attempt to use an automatic digital computer to do arithmetic in the field of real numbers (R, +, ·) is doomed to failure because R is an infinite set and most of the elements in R cannot be represented.
[1] E. V. Krishnamurthy,et al. Finite segmentp-adic number systems with applications to exact computation , 1975 .
[2] Erhan Alparslan. Finite p-adic computing systems with possible applications. , 1975 .
[3] G. B. M.. Theorie der algebraischen Zahlen , 1909, Nature.
[4] E. V. Krishnamurthy,et al. p-Adic arithmetic procedures for exact matrix computations , 1975 .
[5] Robert Todd Gregory. The use of finite-segmentp-adic arithmetic for exact computation , 1978 .