jabowery
Joined 8 years ago
Joined 8 years ago
The prize scores lossless compression of enwik9, a 1GB Wikipedia snapshot, and counts the size of the decompressor. Entries are limited to one CPU core, about 50 hours and under 10GB of RAM. These limits address 3 concerns:
* Specialized hardware biases research toward the industry’s current assumptions. * Talented individuals, not only well-funded labs, can afford to compete. * The public increasingly opposes the resource consumption of superintelligence efforts.
This year three entries improved the record by about 1%, another 1%, and then astoundingly 7.5%, compounded, the largest yearly gain since the prize started in 2006. The record now compresses enwik9 by more than 10x.
What I think matters most: there's no held-out validation set. The whole file is public so incentives to leak data in high stakes benchmarks are for naught. Most AI benchmarks can't say that, and it matters more as AI investment decisions lean on benchmark numbers.
Rules, records and the source code of past winners: http://prize.hutter1.net/. Happy to answer questions.
https://jimbowery.blogspot.com/2017/07/fusion-energy-prize-a...
https://ota.polyonymo.us/others-papers/NetAssetTax_Bowery.tx...
When we got a law passed to privatize space launch services back in 1990
https://www.youtube.com/watch?v=boLdXiLJZoY
we were in the midst of a quasi-depression so I decided to address the problem of private capitalization of technology with the aforelinked proposal.
Any predicate can be considered a constraint. Types are constraints. While it may be reasonable to have syntactic sugars for type declarations that, at compile time, are transformed into predicates, it is unreasonable to lard a completely different kind of semantics on top of an already adequate semantic such as first order logic.
https://groups.google.com/g/comp.lang.prolog/c/8yJxmY-jbG0/m...
https://www.academia.edu/93528167/Interval_Arguments_Two_Ref...
Claude 3 (as Double AI coding assistant): print('0000000001000100001100100001010011000111010000100101010010110110001101011100111110000100011001010011101001010110110101111100011001110101101111100111011111011111')
It's ok* to depart from that starting point in creating subtheories but if you don't start there you'll end up with garbage like the last 50 years of confusion over what "The Minimum Description Length Principle" really means.
*It is, however, _not_ "ok" if what you are trying to do is come up with causal models. You can't get away from Turing complete codes if you're trying to model dynamical systems even though dynamical systems can be thought of as finite state machines with very large numbers of states. In order to make optimally compact codes you need Turing complete semantics that execute on a finite state machine that just so happens to have a really large but finite number of flipflops or other directed cyclic graph of universal (eg NOR, NAND, etc.) gates.
You can tell everyone "who is anyone" is in hysterics when this gets virtually no attention at Salamandar's old stomping ground here at ycombinator.
* The other person with an office opening into Keith's work area at Memex was Ron Resch https://www.historyofcg.com/pages/university-of-utah/
Other leading contributions started with the first networked virtual reality gaming system (Spasim), the first mass market network information service (Viewtron), the first prize for rocketry leading ultimately to the Ansari X-Prize, the first federated login, authentication and authorization system for web-based customer accounts (HP), the first reliance on top-down universal artificial intelligence (AIXI) for natural language understanding (Hutter Prize), and what may have been (unknown due to secrecy requirements in this area) the first high frequency cryptocurrency arbitrage system.
Public life includes leading commercialization of space launch services, testimony before Congress on privatization of space launch services and the first Ka-band communication satellite license issued by the FCC.