Graduate studies at Western
Behavioral and Brain Sciences 28 (4):499-500 (2005)
|Abstract||Steels & Belpaeme (S&B) refer to the neural plausibility and evolutionary plausibility of their algorithms. Although this is not central to their goal of effective artificial agents, their algorithms are not neurally or evolutionarily plausible. Their communication games are interesting, and more complex games would lead to more effective agents. However, the algorithms could be improved either by using standard subsymbolic algorithms or by algorithms that are really neurally or evolutionarily plausible.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Paul Sheldon Davies, James H. Fetzer & Thomas R. Foster (1995). Logical Reasoning and Domain Specificity. Biology and Philosophy 10 (1):1-37.
Helena Rasiowa (1981). On Logic of Complex Algorithms. Studia Logica 40 (3):289 - 310.
Donald Ervin Knuth (2010). Selected Papers on Design of Algorithms. Center for the Study of Language and Information.
Robert Van Rooy (2004). Evolution of Conventional Meaning and Conversational Principles. Synthese 139 (2):331 - 366.
Robert Van Rooy (2004). Evolution of Conventional Meaning and Conversational Principles. Synthese 139 (2):331-366.
Karl Tuyls, Ann Nowe, Tom Lenaerts & Bernard Manderick (2004). An Evolutionary Game Theoretic Perspective on Learning in Multi-Agent Systems. Synthese 139 (2):297 - 330.
Richard E. Korf (1995). Heuristic Evaluation Functions in Artificial Intelligence Search Algorithms. Minds and Machines 5 (4):489-498.
Hermann Wagner & Dirk Kautz (1998). Evolutionary Conservation and Ontogenetic Emergence of Neural Algorithms. Behavioral and Brain Sciences 21 (2):285-286.
Added to index2009-01-28
Total downloads4 ( #190,208 of 757,557 )
Recent downloads (6 months)1 ( #63,427 of 757,557 )
How can I increase my downloads?