Comment by justifier | Hacker News Reader

Comment by justifier | Hacker News Reader

Parent Full thread

> general intelligence better that brute force doesn't exist

What do you mean by this?

It sounds like you are assuming nature requires exactness and are really making a philosophical argument about the nature of computation, namely an np solution in p 'doesnt exist'

> Memory as dna would explain high-level memory quirks

If we are conjecturing than so too could approximate results 'explain high-level memory quirks'

we already have many approximate algorithms that are significantly better than brute force, and I would argue that any read procedure would necessarily be algorithmic, which then would require an explanation as to why this natural process failed to evolve over time

If such an explanation is simply, though arguably counterfactual, 'nature requires exactness' and so is unable to utilize the incremental improvement of evolving algorithms for approximate results, I would argue this implies p!=np because otherwise I think, if it were able, nature would tend toward improving on exactness over the 13B+ years it's been expressing mathematical truths

Being as my intended inference in regard this specific unsolved problem is to develop an algorithm to show p=np, I wonder if the process we refer to as conciousness may be such an algorithm

> neurons using mRNA capsids to communicate

I wonder if the rna is raw memory data or architectural plans for nuerons which, when constructed, express memory

>What do you mean by this?

The goal is to reduce n bits of data to x<n bits. Because there are less variables you gain predictive capability of n-x bits. Or stated differently, the goal is to get closer to the kolmogorov complexity of whatever you're trying to model.

Yet it's not possible to compress n bits in the general case. That's because the kolmogorov complexity is a function of your assumed knowledge (assumptions). All you can do is start checking every possible transformation from your assumption starting with the most probable one - the probabilities are based on your knowledge itself.

>we already have many approximate algorithms that are significantly better than brute force

Yes - but that means the algorithm itself, along with its execution, is the shortest (in the used metric, which can include execution time) answer for a particular problem. How do you generate the algorithm in the first place?

> Yet it's not possible to compress n bits in the general case.

Abstract bits sure, 2^4 objects are unable to represent 2^5 objects, simply due to 16!=32

But what does it have to do with'general intelligence' and brute force?

We were originally talking about rna communication.. where does kolmogrov come in? In the data representation in the rna? But what of it when the mechanism that encodes and decodes is unrestricted in its upper bound complexity? If the disparity between the upper bound of memory being encoded and the mechanism encoding it are great enough then that system could 'compress n bits in the general case'

> All you can do is start checking every possible transformation from your assumption starting with the most probable one - the probabilities are based on your knowledge itself.

This just sounds like you're saying every algorithm is brute force but with different possible states due to assumptions

Would you call Euclid's gcd 'brute force with assumptions'? I would argue algorithm is antonym to brute force

> How do you generate the algorithm in the first place?

Ah, I think I see what you're saying.. are you conjecturing the process of evolving conciousness was itself a brute force process?

Where understanding it's underlying process and being able to implement it ourselves, perhaps even more thermodynamically efficient, is inconsequential due to our efforts being only possible by the original conjectured brute force process that allowed us to abstract to such a degree..? This process being the 'assumption' to be appended to the proof?

But this again seems like a philosophical debate.. one of life and negative entropy

How do you define general intelligence? How do you defend the statement that 'intelligence is equivalent to compression.'?

If you would have to consider all of existence as assumption, then a bitwise representation of our own intelligence would be a significantly small subset of the bitwise representation of all things; expressing this would seem to imply some process substantially more efficient than brute forcing every possible state, or luck is real?, or we underestimate the complexity of 'general intelligence' and in actuality the search is ongoing? Or some undiscussed other?

Reply on news.ycombinator.com