![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
IEEE Annals of the History of Computing, Volume 6
Volume 6, Number 1, January - March 1984
- John C. McPherson:
Early Computers and Computing Institutions. 15-16 - Herbert S. Bright:
Early FORTRAN User Experience. 28-30 - Daniel N. Leeson:
IBM FORTRAN Exhibit and Film. 41-48
Volume 6, Number 2, April - June 1984
- M. Beard, Trevor Pearcey:
The Genesis of an Early Stored-Program Computer: CSIRAC. 106-115 - Kathleen R. Mauchly:
John Mauchly's Early Years. 116-138 - F. Lockwood Morris, Cliff B. Jones
:
An Early Program Proof by Alan Turing. 139-143 - Herbert Hellerman, Robert W. O'Neill, Gene M. Amdahl, Jerome Svigals:
The SPREAD Discussion Continued. 144-151 - Comments, queries, and debate. 163-164
Volume 6, Number 3, July - September 1984
- John Vincent Atanasoff:
Advent of Electronic Digital Computing. 229-282 - Robert Dorfman:
The Discovery of Linear Programming. 283-295 - William Orchard-Hays:
History of Mathematical Programming Systems. 296-312
Volume 6, Number 4, October - December 1984
- J. Barkley Rosser:
Highlights of the History of the Lambda-Calculus. 337-349 - Harry D. Huskey:
From ACE to the G-15. 350-371 - Gordon S. Brown, Norbert Wiener:
Automation, 1955: A Retrospective. 372-383 - Boris A. Trakhtenbrot:
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms. 384-400 - Comments, queries, and debate. 402-405
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.