In a classic learning experiment, a higher vertebrate is presented with two levers. To start, a reward is given if the left lever is pushed, no reward is given if the right lever is pushed. After a certain period of time, T, the meaning of the two levers is interchanged. Now a reward is given if the right lever is pushed and no reward is given if the left lever is pushed. This happens for the same period of time T. Once again there is an interchange in the meaning of the two levers for the period of time T. This alternation is repeated a number of times.

It is shown that the class of Post algebras of finite order n is equationally definable where the only unary operators are the disoint operators Ci, i = 0, 1,..., n -1.

This correspondence identifies the definitions of the above paper in mathematical terms. Both algebraic and logical terms are given.

It has not been noted in the literature that finite-memory least-squares, recursive filters are unstable, and hence unsuited for a large number of recursions. This correspondence modifies the finite-memory least-squares recursive filters to allow for stable solutions.

article Free AccessSingle Function Shifting Counters Authors: John S. Bailey Gilfillan Corporation, Los Angeles, California Gilfillan Corporation, Los Angeles, CaliforniaView Profile , George Epstein Gilfillan Corporation, Los Angeles, California Gilfillan Corporation, Los Angeles, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 9Issue 3July 1962 pp 375–378https://doi.org/10.1145/321127.321134Published:01 July 1962Publication History 4citation277DownloadsMetricsTotal Citations4Total Downloads277Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

This paper develops a systematic method for the synthesis of electronic circuits which must realize symmetric Boolean functions. The ``fold-down'' method, originated by Shannon [1], solves the problem nicely for relay circuits. The electronic circuit, however, composed of ``and,'' ``or,'' and ``not'' elements, does not seem to incorporate the feature of symmetry as readily. It is shown that for symmetric functions a minimal-not condition exists, and that this form is a powerful tool for synthesis. The minimality is not actually proven, except for the case of fundamental symmetric functions. As with the minimal-or circuit, a minimal-not circuit does not necessarily imply the most economical realization, and the design procedure should take account of this fact.