response's below On 10/29/18 1:32 AM, Nanograte Knowledge Technologies via AGI wrote: The concept I see fitting into AGI doesn't involve de-abstraction. Once abstraction occurs, there is no way to go back the other way. The abstraction has the purpose of being able to compare two things that are not easily compared. The "information" that was used in the abstraction process is replaced by a less specific representation that doesn't reveal anything about it's past (except that it came from a specific promoter which is our tie back into the choice.) Not sure what classical SDLC is. (IBM had a communications protocol SDLC, but I'm sure that isn't what you're referring to :) Floated, in the sense of the "best" coming to the top and being visible? When a promoter "wins" the comparison of the moment, the promoter is id'd and can be tied back to the opportunity that the promoter was designed to support. Referral back to what the promoter was promoting for, is what makes the unit work toward the best action for the moment. (the opportunity has a corresponding action to be taken.) Not sure about value chain. To get back to "value" in my architecture, we put a value on an "action" that can be taken (a recipe) knowing that the action has expected value if conditions are suitable for the action. The promoter is essentially watching the conditions, and when conditions are satisfied, the promoter gives a bid that is based on the value of the action - an action that was related to this promoter. So in a simple sense, the promoter, when activated says "hey, I'm promoter 472346 and my benefit bid is 14." If there is no promoted benefit higher than 14 then the promoter's action will be initiated. The abstracted value of 14 compares with other promoters whose calculations are virtually unrelated to how this promoter came to 14. The "relatedness" comes from all promoters being set up by a common abstractor. The promoting system does produce near instantaneous bursts. Every millisecond or so, the decision making process can react to conditions that change. Naturally, there has to be a fast global distribution of changing conditions, and these promoters must be programmed prior to usage. Again, the hard part is building the abstractor, which is where the intelligence exists. Build a strong abstractor, and you have a capable general intelligence. As far as threads (in a processor context) it isn't necessary to devote one thread to one promoter. With the speed of processor today, a single thread could do the promotion for hundreds of simple promoters. Hundreds or thousands of promoters could exist on multiple processors and communicate via a fast network. Programming approach is fairly straight forward for most of the system, but the "magic sauce" is in the abstractor. One can think of the system as built on assertion of facts which become "conditions." Conditions are distributed to promoters who use the data to make simple calculations. The action of asserting a fact is itself the result of the unit taking an action that was promoted - or on a lower level, sensors could assert a fact of some condition. The hard programming is building an abstractor, and the abstractor is likely the last part of the system to mature. The abstractor is tasked with setting a value for an expected outcome and having that value be comparable to values for other outcomes. It's complicated, but the advantage is that we know what we are trying to achieve as we build the code that does abstraction. The rest of the system is not mysterious. what was "this question"? Stan |
- [agi] Abstraction is not simple Jim Bromer via AGI
- Re: [agi] Abstraction is not... Stanley Nilsen
- Re: [agi] Abstraction is... Nanograte Knowledge Technologies via AGI
- Re: [agi] Abstractio... Stanley Nilsen
- Re: [agi] Abstra... Nanograte Knowledge Technologies via AGI
- Re: [agi] Abstra... Alan Grimes
- Re: [agi] A... Stanley Nilsen
- Re: [agi] A... Nanograte Knowledge Technologies via AGI
- Re: [agi] A... Jim Bromer via AGI
- Re: [ag... Mike Archbold via AGI
