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.
| Original language | American English |
|---|---|
| Journal | International Joint Conference on Neural Network |
| DOIs | |
| State | Published - Aug 2007 |
Keywords
- Analog computers
- Computer networks
- Computer science
- Mathematics
- Neural networks
- Psychology
- Recruitment
- Signal processing
- Turing machines
- neural nets
- neural netsneural nets
- paradigmatic connectionist system computation
- program execution
Disciplines
- Computer Sciences
- Artificial Intelligence and Robotics