On Fri, Jan 10, 2020, 7:26 AM John Rose <[email protected]> wrote:
> And then is there a quantum compression system that uses a many paths > simultaneity to seek KC? > > ... seems viable to me but not sure. Matt would know :) > I suppose you could use Grover's algorithm to speed up a search for programs that output the string to be compressed. You could test n programs in O(sqrt(n)) time. Currently there is no hardware capable of implementing it and I don't know of any research in this area. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T65747f0622d5047f-M22a5b0a22f1375fb8b652d25 Delivery options: https://agi.topicbox.com/groups/agi/subscription
