Cart (Loading....) | Create Account
Close category search window
 

An experimental comparison of some algorithms for self-organizing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Several alternative systems of "adjustable logic" are available for use in a self-organizing system having discrete channels as inputs and outputs. For example, a device might consist of a network of McCulloch-Pitts neurons with variable thresholds, or use "summation logic" (refs. 1, 2) with variable weights attached to the input signals. A further possibility is described by Kochen (ref, 3). The system of "adjustable logic" used in the present study depends on the evaluation of a polynomial function of the input signals, with a facility for adjustment of the coefficients of the polynomial terms. The output is a single binary signal of value 0 or 1 depending on whether the polynomial sum is negative or positive. Means are provided for introducing new terms if certain criteria show them to be advantageous, and of eliminating terms which are redundant. It is trivial to show that any logical function whatever can be represented by a polynomial in this way. This system of logic was originally selected because polynomial functions can also be employed in self-organizing systems for continuous variables. (refs. 4, 5, 6, 7). The system with discrete signals was intended to illustrate certain strategies which are applicable to the continuous case. Important differences, however, do exist between the discrete and continuous cases, and further work on continuous systems is in progress. Nevertheless, the work on discrete systems has produced a number of interesting conclusions. The facility whereby extra terms can be added to the polynomial function is similar to the capacity for amoebalike growth shown by the "Janet" program due to Foulkes (ref. 8).

Published in:

Information Theory, IRE Transactions on  (Volume:8 ,  Issue: 5 )

Date of Publication:

September 1962

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.