Computing when multiplications cost nothing
HTML articles powered by AMS MathViewer
- by D. J. Newman PDF
- Math. Comp. 46 (1986), 255-257 Request permission
Abstract:
A (rather strange) computer is considered which costs 1 cent to perform each addition but costs nothing to perform a multiplication. It is shown that the addition chain from 1 to n cost maximally ${(\operatorname {Log} n)^{1/2 + o(1)}}$ rather than the classical $\sim \operatorname {Log} n$.References
Additional Information
- © Copyright 1986 American Mathematical Society
- Journal: Math. Comp. 46 (1986), 255-257
- MSC: Primary 05A99; Secondary 11Y16
- DOI: https://doi.org/10.1090/S0025-5718-1986-0815847-8
- MathSciNet review: 815847