A syntactic description of BC NELIAC
Pages 367-375
Home → Magazine Archive → July 1963 (Vol. 6, No. 7)
A syntactic description of BC NELIAC
Pages 367-375
Real-time programming specifications
Pages 376-383
Checking for loops in networks
Page 384
Polynomial evaluation revisited
Pages 384-385
Further remarks on sampling a tape file—III
Page 384
Page 385
Realizing Boolean connectives on the IBM 1620
Page 385
Algorithm 184: Erlang probalility for curve fitting
Page 386
Algorithm 185: normal probability for curve fitting
Page 386
Algorithm 186: complex arithmetic
Pages 386-387
Page 387
Algorithm 187: differences and derivatives
Page 387
Page 387
Page 388
Page 388
Algorithm 193: reversion of series
Page 388
Algorithm 192: confluent hypergeometric
Page 388
Certification of algorithm 105: Newton Maehly
Page 389
Remark on certification of matrix inversion procedures
Page 389
Certification of algorithms 134 and 158 exponentiation of series
Page 390
Remark on algorithm 150: Syminv2
Page 390
Remark on algorithm 177: least squares solution with constraints
Page 390
Remark on algorithm 150: Syminv2
Page 390
The linking segment subprogram language and linking loader
Page 391
Pages 391-395
Design of a separable transition-diagram compiler
Pages 396-408
A catalogue entry retrieval system
Pages 409-412
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.