Continuous symbol systems: the logic of connectionism
Abstract: "It has been long assumed that knowledge and thought are most naturally represented as discrete symbol systems (calculi). Thus a major contribution of connectionism is that it provides an alternative model of knowledge and cognition that avoids many of the limitations of the tradition...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Knoxville, TN
1991
|
| Schriftenreihe: | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS
1991,145 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "It has been long assumed that knowledge and thought are most naturally represented as discrete symbol systems (calculi). Thus a major contribution of connectionism is that it provides an alternative model of knowledge and cognition that avoids many of the limitations of the traditional approach. But what idea serves for connectionism the same unifying role that the idea of a calculus served for the traditional theories? We claim it is the idea of a continuous symbol system. This paper presents a preliminary formulation of continuous symbol systems and indicates how they may aid the understanding and development of connectionist theories It begins with a brief phenomenological analysis of the discrete and continuous; the aim of this analysis is to directly contrast the two kinds of symbols systems and identify their distinguishing characteristics. Next, based on the phenomenological analysis and on other observations of existing continuous symbol systems and connectionist models, I sketch a mathematical characterization of these systems. Finally the paper turns to some applications of the theory and to its implications for knowledge representation and the theory of computation in a connectionist context. Specific problems addressed include decomposition of connectionist spaces, representation of recursive structures, properties of connectionist categories, and decidability in continuous formal systems. |
| Beschreibung: | 47 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993127 | ||
| 003 | DE-604 | ||
| 005 | 19960215 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)30505384 | ||
| 035 | |a (DE-599)BVBBV008993127 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a MacLennan, Bruce |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Continuous symbol systems |b the logic of connectionism |c Bruce MacLennan |
| 264 | 1 | |a Knoxville, TN |c 1991 | |
| 300 | |a 47 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |v 1991,145 | |
| 520 | 3 | |a Abstract: "It has been long assumed that knowledge and thought are most naturally represented as discrete symbol systems (calculi). Thus a major contribution of connectionism is that it provides an alternative model of knowledge and cognition that avoids many of the limitations of the traditional approach. But what idea serves for connectionism the same unifying role that the idea of a calculus served for the traditional theories? We claim it is the idea of a continuous symbol system. This paper presents a preliminary formulation of continuous symbol systems and indicates how they may aid the understanding and development of connectionist theories | |
| 520 | 3 | |a It begins with a brief phenomenological analysis of the discrete and continuous; the aim of this analysis is to directly contrast the two kinds of symbols systems and identify their distinguishing characteristics. Next, based on the phenomenological analysis and on other observations of existing continuous symbol systems and connectionist models, I sketch a mathematical characterization of these systems. Finally the paper turns to some applications of the theory and to its implications for knowledge representation and the theory of computation in a connectionist context. Specific problems addressed include decomposition of connectionist spaces, representation of recursive structures, properties of connectionist categories, and decidability in continuous formal systems. | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 810 | 2 | |a Computer Science Department: CS |t University of Tennessee <Knoxville, Tenn.> |v 1991,145 |w (DE-604)BV008903301 |9 1991,145 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941951 | ||
Datensatz im Suchindex
| _version_ | 1804123335590674432 |
|---|---|
| any_adam_object | |
| author | MacLennan, Bruce |
| author_facet | MacLennan, Bruce |
| author_role | aut |
| author_sort | MacLennan, Bruce |
| author_variant | b m bm |
| building | Verbundindex |
| bvnumber | BV008993127 |
| ctrlnum | (OCoLC)30505384 (DE-599)BVBBV008993127 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02437nam a2200313 cb4500</leader><controlfield tag="001">BV008993127</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960215 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30505384</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993127</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">MacLennan, Bruce</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Continuous symbol systems</subfield><subfield code="b">the logic of connectionism</subfield><subfield code="c">Bruce MacLennan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Knoxville, TN</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">47 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS</subfield><subfield code="v">1991,145</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "It has been long assumed that knowledge and thought are most naturally represented as discrete symbol systems (calculi). Thus a major contribution of connectionism is that it provides an alternative model of knowledge and cognition that avoids many of the limitations of the traditional approach. But what idea serves for connectionism the same unifying role that the idea of a calculus served for the traditional theories? We claim it is the idea of a continuous symbol system. This paper presents a preliminary formulation of continuous symbol systems and indicates how they may aid the understanding and development of connectionist theories</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It begins with a brief phenomenological analysis of the discrete and continuous; the aim of this analysis is to directly contrast the two kinds of symbols systems and identify their distinguishing characteristics. Next, based on the phenomenological analysis and on other observations of existing continuous symbol systems and connectionist models, I sketch a mathematical characterization of these systems. Finally the paper turns to some applications of the theory and to its implications for knowledge representation and the theory of computation in a connectionist context. Specific problems addressed include decomposition of connectionist spaces, representation of recursive structures, properties of connectionist categories, and decidability in continuous formal systems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">University of Tennessee <Knoxville, Tenn.></subfield><subfield code="v">1991,145</subfield><subfield code="w">(DE-604)BV008903301</subfield><subfield code="9">1991,145</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941951</subfield></datafield></record></collection> |
| id | DE-604.BV008993127 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941951 |
| oclc_num | 30505384 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 47 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |
| spelling | MacLennan, Bruce Verfasser aut Continuous symbol systems the logic of connectionism Bruce MacLennan Knoxville, TN 1991 47 S. txt rdacontent n rdamedia nc rdacarrier University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS 1991,145 Abstract: "It has been long assumed that knowledge and thought are most naturally represented as discrete symbol systems (calculi). Thus a major contribution of connectionism is that it provides an alternative model of knowledge and cognition that avoids many of the limitations of the traditional approach. But what idea serves for connectionism the same unifying role that the idea of a calculus served for the traditional theories? We claim it is the idea of a continuous symbol system. This paper presents a preliminary formulation of continuous symbol systems and indicates how they may aid the understanding and development of connectionist theories It begins with a brief phenomenological analysis of the discrete and continuous; the aim of this analysis is to directly contrast the two kinds of symbols systems and identify their distinguishing characteristics. Next, based on the phenomenological analysis and on other observations of existing continuous symbol systems and connectionist models, I sketch a mathematical characterization of these systems. Finally the paper turns to some applications of the theory and to its implications for knowledge representation and the theory of computation in a connectionist context. Specific problems addressed include decomposition of connectionist spaces, representation of recursive structures, properties of connectionist categories, and decidability in continuous formal systems. Künstliche Intelligenz Artificial intelligence Computer Science Department: CS University of Tennessee <Knoxville, Tenn.> 1991,145 (DE-604)BV008903301 1991,145 |
| spellingShingle | MacLennan, Bruce Continuous symbol systems the logic of connectionism Künstliche Intelligenz Artificial intelligence |
| title | Continuous symbol systems the logic of connectionism |
| title_auth | Continuous symbol systems the logic of connectionism |
| title_exact_search | Continuous symbol systems the logic of connectionism |
| title_full | Continuous symbol systems the logic of connectionism Bruce MacLennan |
| title_fullStr | Continuous symbol systems the logic of connectionism Bruce MacLennan |
| title_full_unstemmed | Continuous symbol systems the logic of connectionism Bruce MacLennan |
| title_short | Continuous symbol systems |
| title_sort | continuous symbol systems the logic of connectionism |
| title_sub | the logic of connectionism |
| topic | Künstliche Intelligenz Artificial intelligence |
| topic_facet | Künstliche Intelligenz Artificial intelligence |
| volume_link | (DE-604)BV008903301 |
| work_keys_str_mv | AT maclennanbruce continuoussymbolsystemsthelogicofconnectionism |