Measures of ideal execution architectures
IBM Journal of Research and Development
Retrospective on high-level language computer architecture
25 years of the international symposia on Computer architecture (selected papers)
A Computing Machine Based on Tree Structures
IEEE Transactions on Computers
Operating systems architecture
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
A language-oriented computer design
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Unconventional superspeed computer systems
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
The hardware-implemented high-level machine language for SYMBOL
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
The design and implementation of a small scale stack processor system
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Developing application oriented computer architectures on general purpose microprogrammable machines
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Software sympathetic chip set design
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
IBM Systems Journal
| Hi-index | 0.00 |
It is an accident that digital computers are organized like desk calculators--with somewhat worse luck we might have taken the Turing machine as our model. And someone would have been unenlightened enough to prove that, under certain (actually untrue) assumptions, it made no difference. All general purpose machines can compute the same functions, given sufficient time.