|
|
|
|
|
by ibgib
3375 days ago
|
|
That sounds pretty freaking good to me...reminds me of the rtNEAT evolutionary algorithm, which combines genetic algorithms real time to evolve anns. This type of approach is what led me to the current data model of ibGib. Each ibGib address is a node and will inevitably compete for attention "resources". The interesting aspect is when you think of any agent's snapshot in time as being the source of a fork which could itself be an agent. So each point in time of an agent configuration is itself its own possible branching agent configuration in thr future. It is monotonically increasing because you never know which agent's state will come in handy to get out of a local max/min. Also, it reuses agent dna (pointers are cheap) so overall this is not as expensive as it sounds. And worst case is that if the overall data store is strained for storage resources, any individual ibgib has its dependencies. So you can do a dependency graph projection, essentially creating a slimmer copy of the original. Btw Your username reminds me of a book series I read as a kid...Taliesin was King Arthur's father maybe? |
|