Preliminary report

Alan J. Perlis, Klaus Samelson · Communications of the ACM · 1958

Although this method is not novel, it has been printed here to summarize for the benefit of a new generation of computer personnel.It should be noted that:1) This method seems advantageous if only a few significant figures are required.Otherwise the normal method, Log-Multiply-Antilog, is more desirable and faster in particular for higher order roots.These subroutines are normally required for other purposes anyway and space is not lost.2) One immediately notices many tricky ways of coding this method for a computer, via looping and the use of tables or converting instructions.Note that, as one proceeds, the contribution of the left-hand term becomes proportionately large enough such that it alone might be used within accuracy limits after a certain number of digits are developed.3) Although the author states that this method used more memory space than other routines, it seems that the converse could well be true if advantage were taken of higher order differences in building up the subtrahend.This appears to be a natural method for a 256 memory machine, if it had good indexing and looping features.Remember that An(X ~) = a constant n[ PRELIMINARY REPORTmlNTERNATIONAL ALGEBRAIC LANGUAGENote:In the interest of immediate circulation of the results of the A C M -G A M M committee work on an algebraic programming language, this preliminary report is presented.The language described naturally enough represents a compromise, but one based more upon differences of taste than on content or fundamental ideas.Even so, it provides a natural and simple medium for the expression of a large class of algorithms.This report has not been thoroughly examined for errors and inconsistencies.It is anticipated that the committee will prepare a more complete description of the language for publication.For all scientific purposes, reproduction of this report is explicitly permitted without any charge.

Cited by 94 works. doi:10.1145/377924.594925 Open-access PDF

Authors