In Proceedings of the 2007 International Joint Conference on Neural Networks (2007)
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||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Similar books and articles
The Allure of Connectionism Reexamined.Brian P. McLaughlin & F. Warfield - 1994 - Synthese 101 (3):365-400.
Content and Its Vehicles in Connectionist Systems.Nicholas Shea - 2007 - Mind and Language 22 (3):246–269.
The Resilience of Computationalism.Gualtiero Piccinini - 2010 - Philosophy of Science 77 (5):852-861.
Computation, Connectionism and Modelling the Mind.Mary Litch - 1997 - Philosophical Psychology 10 (3):357-364.
Added to index2009-01-28
Total downloads98 ( #51,576 of 2,164,579 )
Recent downloads (6 months)9 ( #36,281 of 2,164,579 )
How can I increase my downloads?