Burkhart W. H.. A method for synthesis of two-valued feedback circuits. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 265–272 [Book Review]

Journal of Symbolic Logic 19 (1):56-56 (1954)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267655

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Semon Warren L.. Characteristic numbers and their use in the decomposition of switching functions. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 273–280. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):57-57.
Burkhart W. H.. Theorem minimization. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 259–263. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
Kalin Theodore A.. Formal logic and switching circuits. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 251–257. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (4):345-346.
Jeffrey Richard C.. Arithmetical analysis of digital computing nets. Journal of the Association for Computing Machinery, vol. 3 , pp. 360–375. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (2):190-191.
Elgot Calvin C.. On single vs. triple address computing machines. Journal of the Association for Computing Machinery, vol. 1 no. 3 , pp. 119–123. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):208-209.
Proceedings Symposium on Logic in Computer Science, Ithaca, New York, June 22-25, 1987 ; Sponsored by the Computer Society of the Ieee Technical Committee on Mathematical Foundations of Computing in Cooperation with Acm Sigact, Association for Symbolic Logic, European Association for Theoretical Computer Science.Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science, Ieee Computer Society & Special Interest Group for Automata and Computability Theory - 1987
E. W. Veitch. A chart method for simplifying truth functions. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh1952, pp. 127–133. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
Goodell John D.. Decision elements. Radio-electronic engineering , 07 1952, pp. 3–5. Goodell John D.. The foundations of computing machinery. The journal of computing systems, vol. 1 no. 1 , pp. 1–13.Lode Tenny. The realization of a universal decision element. The journal of computing systems, vol. 1 no. 1 , pp. 14–22. [REVIEW]Nelson M. Blachman & William W. Boone - 1953 - Journal of Symbolic Logic 18 (3):283-284.
Patterson G. W.. What is a code? Communications of the Association for Computing Machinery, vol. 3 no. 5 , pp. 315–318.Richard C. Jeffrey - 1965 - Journal of Symbolic Logic 30 (3):385-385.
Hirschhorn Edwin. Simplification of a class of Boolean functions. Journal of the Association for Computing Machinery, vol. 5 no. 1 , pp. 67–75. [REVIEW]E. J. McCluskey - 1958 - Journal of Symbolic Logic 23 (2):236-237.
Murray F. J.. Mechanisms, and robots. Journal of the Association for Computing Machinery, vol. 2 , pp. 61–82.Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (3):334-335.
McCarthy John. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the Association for Computing Machinery, vol. 3 , pp. 184–195. [REVIEW]Martin Davis - 1968 - Journal of Symbolic Logic 33 (1):117-117.
Lessons from a restricted Turing test.Stuart M. Shieber - 1994 - Communications of the Association for Computing Machinery 37:70-82.
Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge: March 19-22, 1988, Monterey, California.Joseph Y. Halpern, International Business Machines Corporation, American Association of Artificial Intelligence, United States & Association for Computing Machinery - 1986
Markov A. A.. Ob invérsionnoj složnosti sistém funkcij. Doklady Akadémii Nauk SSSR, vol. 116 , pp. 917–919.Markov A. A.. On the inversion complexity of a system of functions. English translation of the preceding by Morris D. Friedman. Journal of the Association for Computing Machinery, vol. 5 , pp. 331–334. [REVIEW]E. N. Gilbert - 1965 - Journal of Symbolic Logic 30 (3):378-379.

Analytics

Added to PP
2016-06-30

Downloads
43 (#360,193)

6 months
19 (#130,585)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references