http://www.necsi.edu/education/aguiarseminar.html
Date: October 31, 2008
Time: 2:00 PM
Location: NECSI, 24 Mt. Auburn Street, Cambridge
Abstract:
Networks are mathematical structures that can model a large number of systems in biology, physics, engineering and the social sciences. In this talk, I will give a brief introduction to the theory of networks and review some of the work I have done in […]

Check out more of Randy’s stuff here, and to learn more about Kolmogorov Complexity check the wikipedia link here.
In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov-Chaitin complexity, stochastic complexity, algorithmic entropy, or program-size complexity) of an object such as a piece of text is a […]

SUARO has been updated with a couple more articles further explaining the problem of complexity in its relation to AI.
Hope all is well.
Worldpeace,
Ben

Ben mentioned this in his AGI 08 talk. Thought I’d include it here … this basically summarizes the spirit of the question I’ve been asking lately, which is: what can I do RIGHT NOW in order to help?
Abstract: An algorithm M is described that solves any well-defined problem p as quickly as […]

Ben is having a conversation with another user on YouTube and is absolutely nailing the explanation.
We’re moving forward in so far as it benefits us to do so. Please watch and be well.

var AdBrite_Title_Color = \’0000FF\’;
var AdBrite_Text_Color = \’000000\’;
var AdBrite_Background_Color = \’FFFFFF\’;
var […]