From: William Lim
Subject: Definitions for symbolic and subsymbolic learning algorithms
Date: Mon, 02 Oct 1995 00:00:00 +0000
Message-ID: <lim.60.0015C2D0@okstate.edu>

hi

   I am seeking help in coming up with formal definitions for symbolic 
learning and subsymbolic algorithms.
   As I understood, the learning process for subsymbolic algorithms progress 
as the strength of atoms (weigths) slowly shifts in response to observation 
(testing). The information is encoded into weights.
   As for symbolic learnig, a new rules or schemas are created whenever 
something "new" appear that is not in the class or rules. New rules or shcemas 
created as the learning progress.
   Please give me some help a simple and precise definitions for the 
subsymbolic and symbolic learnign algorithms. 

Thanks.

William Lim
···@a.cs.okstate.edu

(Note: PS send reply to ···@a.cs.okstate.edu. Thanks)