True, the smaller code is the better algorithm, as long as it is not slow brute 
force. Code can become longer if you do heuristics but is faster. You can 
create a code a few pages long only that is much faster than brute force and 
almost gives best compression (for wiki8 and related data). So in essence, the 
speed of the algorithm and the size of memory it uses / ends up at is based on 
the code; we want a small but just longer enough code than brute force's to get 
both lower memory usage than brute force and more speed than brute force. So 
yes talking about the length of the code is the target, simple ideas win, so me 
wondering about the lowest compression and/or fastest speed is directly 
referring to the shorter algorithm, I mean do you want me to ask you instead 
what is the shortest/simplest code you've seen? But it better compress and be 
fast, hence I asked you that, and I actually asked you which have seen in your 
life so far had best compression on wiki8 regardless of speed?
------------------------------------------
Artificial General Intelligence List: AGI
Permalink: 
https://agi.topicbox.com/groups/agi/T65747f0622d5047f-M59a3d48038c8a03fc8f6464d
Delivery options: https://agi.topicbox.com/groups/agi/subscription

Reply via email to