• DocumentCode
    279207
  • Title

    Rules in computationalism and connectionism

  • Author

    Adam, F. ; Aizawa, K. ; Fuller, G.

  • Author_Institution
    Dept. of Philos., Central Michigan Univ., Mount Pleasant, MI, USA
  • Volume
    iii
  • fYear
    1991
  • fDate
    8-11 Jan 1991
  • Firstpage
    359
  • Abstract
    Connectionist and computationalist theories are contrasted in many ways in the literature. Extremely common among these contrasts are distinctions that in various ways involve rules. For example, connectionist models are not supposed to use explicit rules where computationalist models do. Connectionist models are said to use soft rules, or soft constraints, where computationalist models do not. The authors believe that, while the distinctions that have been offered in the literature make sense, they do not serve to contrast computationalist models as a class from connectionist models as a class. In other words, for each of the distinctions that has been offered, they believe there to exist both computationalist and connectionist models that fall on either side of the distinctions. Thus, both connectionist and computationalist models may be said to use explicit rules, to use soft rules, and so forth
  • Keywords
    computational complexity; formal logic; parallel processing; PDP; computationalist theories; connectionist models; explicit rules; parallel distributed processing models; soft constraints; soft rules; Computational modeling; Computer architecture; Computer networks; Concurrent computing; Distributed computing; Distributed processing; Production systems; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Sciences, 1991. Proceedings of the Twenty-Fourth Annual Hawaii International Conference on
  • Conference_Location
    Kauai, HI
  • Type

    conf

  • DOI
    10.1109/HICSS.1991.184164
  • Filename
    184164