Brownian nose. Ya, try to compress that. Distribution can be done with a traveling window nested traveling window algorithm. One for your seed size, bit, nibble, byte, word, or other. The other is size of the window or the amount of date taken in at a time. This will give a model of many levels but only dwell on the sweet spot that give meaning full information in P versus NP time.
------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T8c8ee84b385720a5-M5b4ff7e02d4ee8e0ce82102d Delivery options: https://agi.topicbox.com/groups/agi/subscription
