Um, this > A tree datastructure can be made using lists, contexts stored 
overlap each other and hence the tree structure ex. walk/ wall/ waaa/ wbbb/ 
wind/ wink. Layer one of the tree usually fills up quickly and fully and has 
all possible 1 letter items. 256 of them. There is much more 2 letter items in 
layer two, and most won't be seen in our timeframe. By layer ex. 5 many items 
are seen only once, hence you don't need to store layer 6 or further until see 
it a second time ex. you saw walked and walking and walkzzz, notice walk is saw 
lots but walki is seen only one time in walking. So the tree only grows deeper 
when it sees a branch more and more.
------------------------------------------
Artificial General Intelligence List: AGI
Permalink: 
https://agi.topicbox.com/groups/agi/Tb5526c8a9151713b-Mfb346ed6a563e9091102eb18
Delivery options: https://agi.topicbox.com/groups/agi/subscription

Reply via email to