• DocumentCode
    1940077
  • Title

    Connectionist Computation

  • Author

    Piccinini, Gualtiero

  • Author_Institution
    Univ. of Missouri -St. Louis, St. Louis
  • fYear
    2007
  • fDate
    12-17 Aug. 2007
  • Firstpage
    31
  • Lastpage
    36
  • 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.
  • Keywords
    neural nets; paradigmatic connectionist system computation; program execution; Analog computers; Computer networks; Computer science; Mathematics; Neural networks; Psychology; Recruitment; Signal processing; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 2007. IJCNN 2007. International Joint Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1098-7576
  • Print_ISBN
    978-1-4244-1379-9
  • Electronic_ISBN
    1098-7576
  • Type

    conf

  • DOI
    10.1109/IJCNN.2007.4370926
  • Filename
    4370926