Connectionist computation

In Proceedings of the 2007 International Joint Conference on Neural Networks (2007)
  Copy   BIBTEX

Abstract

The following three theses are inconsistent: (1) (Paradigmatic) connectionist systems perform computations. (2) Performing computations requires executing programs. (3) Connectionist systems do not execute programs. Many authors embrace (2). This leads them to a dilemma: either connectionist systems execute programs or they don't compute. Accordingly, some authors attempt to deny (1), while others attempt to deny (3). But as I will argue, there are compelling reasons to accept both (1) and (3). So, we should replace (2) with a more satisfactory account of computation. Once we do, we can see more clearly what is peculiar to connectionist computation

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,594

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
115 (#107,078)

6 months
2 (#278,494)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gualtiero Piccinini
University of Missouri, St. Louis

Citations of this work

Computing Mechanisms.Gualtiero Piccinini - 2007 - Philosophy of Science 74 (4):501-526.

Add more citations

References found in this work

No references found.

Add more references