Journal of the ACM (JACM)


Search Issue
enter search term and/or author name


Journal of the ACM (JACM), Volume 8 Issue 4, Oct. 1961

Turing Machines, Finite Automata and Neural Nets
Michael Arbib
Pages: 467-475
DOI: 10.1145/321088.321089
This paper1 compares the notions of Turing machine, finite automaton and neural net. A new notation is introduced to replace net diagrams. “Equivalence” theorems are proved for nets with receptors, and finite...

5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
Shigeru Watanabe
Pages: 476-483
DOI: 10.1145/321088.321090

A Generalized Tree Circuit
H. Allen Curtis
Pages: 484-496
DOI: 10.1145/321088.321091
From the very founding of switching theory by Claude E. Shannon, the tree circuit has been a useful instrument in the design of logic networks. Besides being a valuable practical addition to the designer's “tool kit”, it has been a...

Some Methods for Simplifying Switching Circuits Using “Don't Care” Conditions
J. T. Chu
Pages: 497-512
DOI: 10.1145/321088.321092
Several methods for simplifying switching circuits using “don't-care” conditions are suggested. One of the methods uses the following procedure: Let the given circuit be represented by the truth function F. Let the...

An Automatic Sequencing Procedure with Application to Parallel Programming
Eugene S. Schwartz
Pages: 513-537
DOI: 10.1145/321088.321093
An automatic sequencing procedure for assigning sets of instructions to predesignated autonomous units of a multiprocessor is described. The procedure is based upon an assignment matrix developed from a precedence matrix. By associating a column...

A Study of Methods for Systematically Abbreviating English Words and Names
Charles P. Bourne, Donald F. Ford
Pages: 538-552
DOI: 10.1145/321088.321094
This study investigated various techniques for systematically abbreviating English words and names. Most of the attention was given to the techniques which could be mechanized with a digital device such as a general purpose digital computer....

Semantic Road Maps for Literature Searchers
Lauren B. Doyle
Pages: 553-578
DOI: 10.1145/321088.321095

A Descriptive Language for Symbol Manipulation
Robert W. Floyd
Pages: 579-584
DOI: 10.1145/321088.321096

Design of Sequential Machines from Their Regular Expressions
Gene Ott, Neil H. Feinstein
Pages: 585-600
DOI: 10.1145/321088.321097
Procedures are given to convert any regular expression into a state diagram description and neural net realization of a machine that recognizes the regular set of sequences described by the given expression. It is established that any regular...

Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
Thomas N. Hibbard
Pages: 601-612
DOI: 10.1145/321088.321098

Representation of Power Series in Terms of Polynomials, Rational Approximations and Continued Fractions
Kurt Spielberg
Pages: 613-627
DOI: 10.1145/321088.321099

On Least Squares Solutions of Linear Equations
E. E. Osborne
Pages: 628-636
DOI: 10.1145/321088.321100

An Evaluation of Runge-Kutta Type Methods for Higher Order Differential Equations
Charlotte Froese
Pages: 637-644
DOI: 10.1145/321088.321101

Asymptotic Behavior of the Best Polynomial Approximation
E. K. Blum, P. C. Curtis, Jr.
Pages: 645-647
DOI: 10.1145/321088.321102
Let ƒ (x) be a real-valued function defined and continuous on [- 1, +1] and let T(x) = a0/2 +...

Letter to the Editor: Optimized Subroutines
R. J. Gardner, T. H. Gossling
Pages: 648-649
DOI: 10.1145/321088.321103

Letter to the Editor: Internal Sorting and External Merging
Martin A. Goetz
Pages: 649-650
DOI: 10.1145/321088.321104