Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Jim 1) Via resident, evolutionary algorithms for mutation, transformation, variation, and recombination. 2) Across a quantum communications network, damaged code would simply be resent via recombined message packages and rerouting algorithms until the atoms find a gap in the protective

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

How could the meta-operations be effectively (efficiently) learned (or acquired from experience)? And even if an encoding was not hackable in the sense that it could not be understood and hacked into, it still could be hackable in the sense the data could be damaged. Jim Bromer On Fri, Jun 16,

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

A friend pointed out to me the core of a Grape system is based on learning. This got me thinking about this logical problem you have proposed. How to learn without making it about learning? So, in my laymans language the,I think you could generate a symbolic schema, which would relate back to

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

I have been really busy but I thought about the subject a little. Most programs use concise representations of data -as they relate to the program- and so I guess many programs do operate on these program-related representations. These might be characterized as partial compressions since typically

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Rob, I will look at the paper when I get a chance. Jim Bromer On Wed, Jun 7, 2017 at 7:16 PM, Rob Freeman wrote: > Jim, > > Have a look at this paper and see if you find it relevant. I understand it > to be a sketch for logic using distributed representation. RNN's

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Jim, Have a look at this paper and see if you find it relevant. I understand it to be a sketch for logic using distributed representation. RNN's still globally optimize, so I think they will still have lossy compression (instead of partial compression?) But the idea of using distributed

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Jim, I really don't know if I'm finding common ground. But your words "selective compression" still read to me like saying compression must be partial. And where compression must be partial, I still think the best way will be to deal directly with uncompressed data. The point is that if you do

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Rob, I am trying to make improvements on the analysis of logical statements. My idea is that a program can analyze Satisfiabilty statements, (logical statements where the states of some logical variables are not assigned values), by using a system of selective compression. The problem of finding

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Jim, It is hard to understand what you are suggesting. But I get a hunch you may be saying something like the idea I have been promoting for a long time. This is that for cognition all or most compressions will at best be partial (lossy?) I suppose you could keep a list of outlier data for each

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

*A program could create new rules at a higher abstraction level that could operate on the rules that exist at a lower level. (This characterization is relative but I think it is useful.) This might allow for greater compressive individuation.* *So creating individuated sub programs based on the

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

Most programs operate on a higher level of rules which operate on the data that is encountered. This higher level program is a kind of general abstraction. A program can create new rules at higher abstraction that could operate on the rules at a lower level. (This characterization is relative but

Re: [agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

I realized that the encoding example was not a very good one because a compression method has to include a way to decompress the data to produce the reference object. Suppose you used generalizations which either referred to elaborate data objects or which could be elaborated more fully based on

[agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

An encoding is almost always a compression method. The data encoding is referring to some kind of object or event which can be described more fully. So anytime we devise or use an encoding and a system of operations that can act on those encoded references we are effectively developing a

[agi] Re: Is It Feasible to Run a Computation on Compressed Logical Data?

I realized that traditional logic is a system of compression which allows for some computations that can be run without fully decompressing the data. However, at certain steps at some (relatively low) levels of complexity the data has to be decompressed (to a great degree). So this example proves