You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more
I wonder if one can find empirical evidence of a link between the Kolmogorov complexity of a task and that of its solutions. Intuitively, I would think that problems that are simple to fully specify can be solved with comparably simple algorithms.
Such a link would be especially interesting with regard to the development of "general" AI
There are many problems that are easy to state but provably impossible to solve such as the halting problem and satisfiability of first order logic. How would that affect your hypothesis?
We're talking about solvable tasks, and concerned not about runtime complexity but instead about Kolmogorov complexity of the shortest possible solution
Anecdotal, not empirical, but: Collatz conjecture (easy to state, unsolved), and "return the last digit of this huge, incompressible number" (big KC, trivial)
But this is a joke account tralala don't mind me!
I question the value of KC descriptive complexity as a tool for assessing problems and/or getting to general AI! Most supply chain AI problems I work on are simple to "describe" but implmntn vary widely. As you know, in DL, 25lines of code can have huge variation in complexity
I agree with this sentiment. I doubt there's a relationship with algorithmic complexity and general intelligence. Human's have general intelligence but are no where near the capabilities of computers in performing algorithms.
@r13bdooo عرفت مقداري عندك ورب البيت 
زوجك تحظرينو برافو برافو
@r13bdooo ردو لي خبرن في بكره بترجعين والا اتصرف
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
