Rene De La Briandais
Page 0.12
Norman Sanders
Page 0.13
R. W. Bemer
Page 0.12
F. G. Duncan
Page 0.13
Paul E. Des Jardins
Page 0.13
C. A. Piper
Page 13
Harry D. Huskey
Page 136
The applicability of computers to many problem-solving situations—chess playing, mathematical proofs, music composition, etc.—has been demonstrated. We wish to explore further heuristic processes suggested by human problem-solving …
Aiko Hormann
Page 138
The basic idea of UNCOL Universal Computer-Oriented Language—is to introduce a language between problem-oriented languages, POLs, and machine languages, MLs. This third level consists of a single language, UNCOL, which has the …
W. B. Dobrusky, T. B. Steel
Page 138
Roy Goldfinger
Page 138
Syndey P. Levine
Page 139
John A. Swets
Page 139
R. F. Simmons
Page 140
SDC is currently engaged in producing a “JOVIAL” compiler for each of its computers. The compilers are being produced by a bootstrapping method similar to that described in a report on UNCOL [1]. In discussing the steps involved …
Harvey Bratman
Page 140
Charles E. Clark
Page 141
Three iterative methods for calculation of
nth roots (including one proposed by the author) are compared in two ways: (1) Theoretical convergence estimates are given. (2) A new macro-compiler which estimates machine running time …
J. F. Traub
Pages 143-145
Recent contributions on the subject of counting the ones or reversing the digits of a binary word have prompted some rather more general observations on bitwise operations which treat each binary digit in a computer word as a …
C. Strachey
Page 146
Douglas T. Ross
Pages 147-150
K. A. Brons
Pages 151-152
A. J. Gianni
Page 151
T. C. Wood
Page 151
K. A. Brons
Page 151
Papken Sassouni
Page 152
B. Leavenworth
Pages 152-153
J. H. Wilkinson
Page 153
Patty Jane Rader
Pages 153-154
Robert M. Collinge
Page 154
Henry C. Thacher
Page 154
B. A. Batchelder
Pages 139-140
Harvey Bratman
Page 142
