Selected papers that cite this one
- E. K. Blum. Towards a theory of semantics and compilers for programming languages. In Conference Record of ACM Symposium on Theory of Computing, pages 217-227, Marina del Rey, California, 5-7 May 1969.
- Nadia Busi, Roberto Gorrieri, and Gianluigi Zavattaro. A process algebraic view of Linda coordination primitives. Theoretical Computer Science, 192(2):167-199, 20 February 1998.
- John Cocke and Marvin Minsky. Universality of tag systems with P = 2. Journal of the ACM, 11(1):15-20, January 1964.
- Robert L. Constable and Allan B. Borodin. Subrecursive programming languages, part I: Efficiency and program structure. Journal of the ACM, 19(3):526-568, July 1972.
- Stephen A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4-18, January 1971.
- Calvin C. Elgot and Abraham Robinson. Random-access stored-program machines, an approach to programming languages. Journal of the ACM, 11(4):365-399, October 1964.
- Gabor T. Herman and Stephen D. Isard. Computability over arbitrary fields. In Conference Record of ACM Symposium on Theory of Computing, pages 149-153, Marina del Rey, California, 5-7 May 1969.
- J. Lambek. Programs, grammars and arguments: A personal view of some connections between computation, language and logic. The Bulletin of Symbolic Logic, 3(3):312-328, September 1997.
- D. L. Overheu. An abstract machine for symbolic computation. Journal of the ACM, 13(3):444-468, July 1966.
- David Pager. On the efficiency of algorithms. Journal of the ACM, 17(4):708-714, October 1970.
Selected references
- C. Y. Lee. Categorizing automata by W-machine programs. Journal of the ACM, 8(3):384-399, July 1961.
- Hao Wang. A variant to Turing's theory of computing machines. Journal of the ACM, 4(1):63-92, January 1957.