We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon.
@article{ITA_2001__35_2_187_0,
author = {Gr\"ubel, Rudolf and Reimers, Anke},
title = {On the number of iterations required by Von Neumann addition},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {35},
year = {2001},
pages = {187-206},
mrnumber = {1862462},
zbl = {1053.68051},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2001__35_2_187_0}
}
Grübel, Rudolf; Reimers, Anke. On the number of iterations required by Von Neumann addition. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 35 (2001) pp. 187-206. http://gdmltest.u-ga.fr/item/ITA_2001__35_2_187_0/
[1] , Probability and Measure, 2nd Ed. Wiley, New York (1986). | MR 830424 | Zbl 0649.60001
[2] , and, Preliminary discussion of the logical design of an electronic computing instrument. Inst. for Advanced Study Report (1946). Reprinted in John von Neumann Collected Works, Vol. 5. Pergamon Press, New York (1961). | MR 22442
[3] , and, A stochastically quasi-optimal algorithm. Preprint (1999).
[4] , Die mittlere Additionsdauer eines Paralleladdierwerks. Acta Inform. 2 (1973) 283-291. | MR 366092 | Zbl 0304.68048
[5] , and, Introduction to Algorithms. MIT Press, Cambridge, USA (1997). | MR 1066870 | Zbl 1047.68161
[6] , and, Mellin transforms and asymptotics: Harmonic sums. Theoret. Comput. Sci. 144 (1995) 3-58. | MR 1337752 | Zbl 0869.68057
[7] , Algorithmische Zahlentheorie. Vieweg, Braunschweig (1996). | Zbl 0870.11001
[8] , Hoare's selection algorithm: A Markov chain approach. J. Appl. Probab. 35 (1998) 36-45. | Zbl 0913.60059
[9] , On the median-of- version of Hoare’s selection algorithm. RAIRO: Theoret. Informatics Appl. 33 (1999) 177-192. | Numdam | Zbl 0946.68058
[10] and, Asymptotic distribution theory for Hoare's selection algorithm. Adv. Appl. Probab. 28 (1996) 252-269. | Zbl 0853.60033
[11] , The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley, Reading (1973). | MR 445948 | Zbl 0302.68010
[12] , The average time for carry propagation. Nederl. Akad. Wetensch. Indag. Math. 40 (1978) 238-242. | MR 497803 | Zbl 0382.10035
[13] , Concentration, in Probabilistic Methods for Algorithmic Discrete Mathematics, edited by M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed. Springer, Berlin (1998). | Zbl 0927.60027
[14] and, Large deviations for Quicksort. J. Algorithms 21 (1996) 476-507. | MR 1417660 | Zbl 0863.68059
[15] , A limiting distribution for quicksort. RAIRO: Theoret. Informatics Appl. 23 (1989) 335-343. | Numdam | MR 1020478 | Zbl 0677.68072
[16] , Extreme Values, Regular Variation and Point Processes. Springer, New York (1987). | MR 900810 | Zbl 0633.60001
[17] , A limit theorem for “Quicksort”. RAIRO: Theoret. Informatics Appl. 25 (1991) 85-100. | Numdam | Zbl 0718.68026
[18] , Real and Complex Analysis, 2nd Ed. Tata McGraw-Hill, New Delhi (1974). | MR 344043 | Zbl 0278.26001
[19] , Computer Number Systems & Arithmetic. Prentice-Hall, New Jersey (1985). | Zbl 0613.65046
[20] and, An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996). | Zbl 0841.68059
[21] , Effiziente Algorithmen für grundlegende Funktionen. B.G. Teubner, Stuttgart (1996). | MR 1076624 | Zbl 0697.68011