Jeff Hawkins, Numenta: “Prospects and Problems of Cortical Theory” This is the 10th and final talk given at the Redwood Center for Theoretical Neuroscience Inaugural Symposium UC Berkeley, October 7, 2005 Audio/Visual: sound, color Language: english Keywords: Theoretical Neuroscience; Cortex; Brain; AI, Memory; Hierarchy; Neural Networks Contact Information: Kilian Koepsell , Redwood Center for Theoretical […]

Google Tech Talks
January, 10 2008
ABSTRACT
Syllabus and Recommended Literature
This tech talk series explores the enormous opportunities afforded by the emerging field of quantum computing. The exploitation of quantum phenomena not only offers tremendous speed-ups for important algorithms but may also prove key to achieving genuine synthetic intelligence. We argue that understanding higher brain function requires references […]

Eliezer Yudkowsky is one of the world’s foremost researchers on Friendly AI and recursive self-improvement. He created the Friendly AI approach to AGI, which emphasizes the importance of the structure of an ethical optimization process and its supergoal, in contrast to the common trend of seeking the right fixed enumeration of ethical rules a moral […]

Software innovator Anand Agarawala demonstrates his BumpTop graphical interface at the TED conference in March of 2007. The BumpTop truly tales 2D interface technology and drags it into the third dimension.

HELL YEAH.
The usurpation has begun.
The usurpation is complete.
Complete and total ultimate revolution in computing.
Stay up on those chips … the information is more valuable than the material. The information on how to build the machinery … the knowledge of the science behind the technology … you might consider formalizing this data and gifting it […]

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 […]

This is a fantastic page I’m turning here. I just acquired Seth Lloyd’s “Programming the Universe” … I have Gershenfeld’s “Fab” on tap and ready to go … of course I’m an amateur and have hardly an ounce of understanding concerning the actual technique and mathematics of this concept; I work with cruder forces. […]

The Chinese Room argument is a thought experiment and associated arguments designed by John Searle (Searle 1980) to show that a symbol processing machine like a computer can never be properly described as having a “mind” or “understanding”, regardless of how intelligently it may behave.
http://en.wikipedia.org/wiki/Chinese_Room
I’ve had this in tab for about a week now and […]