Signature Table Systems and Learning

@article{Biermann1982SignatureTS,
  title={Signature Table Systems and Learning},
  author={Alan W. Biermann and John Fairfield and Thomas R. Beres},
  journal={IEEE Transactions on Systems, Man, and Cybernetics},
  year={1982},
  volume={12},
  pages={635-648}
}
A characterization theorem is given for the classes of functions which are representable by signature table systems. The usefulness of the theorem is demonstrated in the analysis and synthesis of such systems. The limitations on the power of these systems come from the restrictions on the table alphabet sizes, and a technique is given for evaluating these limitations. A practical learning system is proposed and analyzed in terms of the theoretical model of this paper. Then an improved method is… CONTINUE READING
13 Citations
9 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The Duke checker program

  • T. R. Truscott
  • J. Recreational Math., vol. 12, 1979.
  • 1979
1 Excerpt

Estimation of run times using signature table analysis

  • H. A. Curtis, A New Approach to the Design of Switching Circuits. Princeton, +16 authors P. D. Amer
  • NBS Special Publication 500-14 Fourteenth Comput…
  • 1978
1 Excerpt

A new machine learning technique applied to the game of checkers

  • A. K. Griffith
  • Mass. Instit. Technol. Project MAC A.I. Memo 94…
  • 1966
1 Excerpt

Learning Machines

  • N. J. Nilsson
  • New York: McGraw-Hill,
  • 1965
1 Excerpt

" Functional decomposition and switching circuit design

  • R. M. Karp
  • J . Soc . Industrial Applied Math .
  • 1962

, " The decomposition of switching functions

  • R. L. Ashenhurst
  • An Introduction to Combinatorial Analysis
  • 1959

Similar Papers

Loading similar papers…