Communications of the ACM

Letters

B. Arden, B. Galler, R. Graham
Page 13

---

The future of automatic digital computers

Before discussing the future I want to talk about the past, which I find a source of disappointment. One of the things which prompted me to give the lecture its title was that a number of people who should know better have recently … Andrew D. Booth
Pages 339-341

---

The department of computer mathematics at Moscow State University

For the preparation of specialists in computer and machine mathematics and the development of scientific work in this area, the department of computer mathematics was created in 1949 in Moscow State University within the staff … I. S. Berezin
Pages 342-344

---

Compiling connectives

The connectives “and”, “or” and their alternatives can be used to connect words, phrases or clauses in natural English. In the specifications for the FACT language for the Honeywell 800(1), authors attempted to include as many … Charles J. Swift
Pages 345-346

---

Note of amplification

Robert W. Floyd
Page 346

---

Multiprogram scheduling: parts 1 and 2. introduction and theory

In order to exploit fully a fast computer which possesses simultaneous processing abilities, it should to a large extent schedule its own workload. The scheduling routine must be capable of extremely rapid execution if it is  … E. F. Codd
Pages 347-350

---

A short method for measuring error in a least-squares power series

When fitting a curve to a set of points by means of a least-squares powers series, it is frequently desirable to obtain also a measure of the total error of the curve. Such error is most often measured by the size of the residual … S. M. Robinson, G. W. Struble
Page 351

---

Conversion between floating point presentation

C. Perry
Page 352

---

Algorithms: evaluation of the Legendre polynomial Pn(X) by recursion

G. M. Galler
Page 353

---

Algorithms: evaluation of the Chebyshev polynomial Tn(X) by recursion

G. M. Galler
Page 353

---

Algorithms: evaluation of the Hermite polynomial Hn(X) by recursion

G. M. Galler
Page 353

---

Algorithms: evaluation of the Laguerre polynomial Ln(X) by recursion

G. M. Galler
Page 353

---

Certification: rootfinder

J. Wegstein, Henry C. Thacher
Page 354

---

Certification: solution of polynomial equation by Bairstow-Hitchcock method

A. A. Grau, H. C. Thacher
Page 354

---

The solution of simultaneous ordinary differential equations using a general purpose digital computer

W. H. Anderson
Pages 355-360

---

Interval estimation of the time in one state to total time ratio in a double exponential process

W. R. Neal
Pages 361-366

---