No label defined (Q3789097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4053056 |
Statements
1988
0 references
McCulloch and Pitts network
0 references
coupling coefficients
0 references
sum of two binary numbers
0 references
0.7427237629890442
0 references
0.718541145324707
0 references
0.7183976173400879
0 references
0.7155114412307739
0 references
[For the entire collection see Zbl 0638.00044.] We present a modified version of a McCulloch and Pitts network together with its associated language. We also give the assembler needed to translate a program's symbolic form, viz. any wff belonging to the propositional calculus, into the values associated to the couplings between the network nodes, namely into the ``coupling coefficients'' values. As an example of the practical application for the said results it is presented the program for the sum of two binary numbers together with the corresponding coupling coefficients values. It is then discussed the role that the memory can play as a metarule for the given language and a way to store into the coupling coefficients values the relevant interactions between the network, seen as a data driven machine, and an unpredictably evolving environment. Since to change the coupling coefficients alters the stored programs, viz. the network responses to the environment stimuli, this is a way to implement learning.
0 references