Article based on Ph.D. dissertation at Carnegie Tech. "... the problem of meaning is of major importance in the study of the nature of intelligence, and that a useful definition of meaning must include not only denotation but connotation and implication as well. To handle these important questions it is necessary to study cognitive organizations which are more complex than those upon which most psychological theories are based. A central question is the storage of large numbers of interrelated propositions in a manner which efficiently uses memory capacity." In E.A. Feigenbaum & J. Feldman (Eds.) Computers and Thought, pp. 217-233. McGraw-Hill, 1963.

Technical Report, Panoramic Research, Inc, Palo Alto, CA

Englewood Cliffs, N.J.: Prentice Hall

In Self-Organizing Systems 1962, pp 435–461.

A model of human information processing during concept formation has been constructed, using a list processing, digital computer program. The program's input consists of descriptions of objects in terms of dimensions and values. The universe of objects is divided into two or more sets. The program attempts to form a decision rule, based upon the descriptions of the objects, which can be used to assign any previously presented or new object to its correct set. The program is a model for human information processing, rather than an artificial intelligence system.

This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research. This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged.

The programming of a proof procedure is discussed in connection with trial runs and possible improvements. In [1] is set forth an algorithm for proving theorems of quantification theory which is an improvement in certain respects over previously available algorithms such as that of [2]. The present paper deals with the programming of the algorithm of [1] for the New York University, Institute of Mathematical Sciences' IBM 704 computer, with some modifications in the algorithm suggested by this work, with the results obtained using the completed algorithm. Familiarity with [1] is assumed throughout. The algorithm of [1] consists of two interlocking parts.

Did you know your Organization can subscribe to the ACM Digital Library?

COVID-19 has impacted many institutions and organizations around the world, disrupting the progress of research. Through this difficult time APS and the Physical Review editorial office are fully equipped and actively working to support researchers by continuing to carry out all editorial and peer-review functions and publish research in the journals as well as minimizing disruption to journal access. We appreciate your continued effort and commitment to helping advance science, and allowing us to publish the best physics journals in the world. And we hope you, and your loved ones, are staying safe and healthy.

In my view, the present "critical situation" in M.T., is not due to the fact that genuine Mechanical Translation is inherently impossible, as Bar-Hillel thinks, but to the fact that the mechanizable techniques at present being used to analyse language are not powerful enough to detect the message, or argument, of any particular text. Other papers from this conference online. See Table of Contents with links to online papers from the Proc. 1961 International Conference on Machine Translation of Languages and Applied Language Analysis (http://www.mt-archive.info/NPL-1961-TOC.htm). Proc. 1961 International Conference on Machine Translation of Languages and Applied Language Analysis, pp. 438-475, London: Her Majesty's Stationery Office, 1962.