For anyone interested in an “open Internet” (not as the big cable companies and wireless carriers define it), take a look at this entertaining coverage of the new Net Neutrality proposal by the FCC. Please comment on the new proposal at the FCC website.
You can also learn more at the Entertainment Consumers Association website here. Through the ECA website, you can provide your information and it will generate form letters for your local representatives in Congress, the President of the United States, and the FCC.
I just ran across possibly the most awesome Star Wars item ever. Nikko America has a special edition remote controlR2-D2 home theater audio/video projector that does just about everything. It has a ton of features, including being able to project on the ceiling (not sure I’d ever use that), official sounds, and a ton of inputs including an iPod dock. The tech specs are pretty good, but I’m sure you can build your own home theater that is better with less than the $2900 price tag. It won’t have the massive geek factor that R2-D2 has though. Be sure to check out the video to see it in action.
Tonight with my wife, I watched an interesting episode of Nova titled “The World’s Smartest Machine.” Romantic, right? You can tell we are a couple of geeks at heart. Being a huge fan of Asimov and his robot creations, I am continually amazed at the progress of robotics and artificial intelligence. As a kid I was playing chess as early as the 3rd grade. I’ve always thought of myself as a pretty good chess player. When I heard about a computer that supposedly could beat a world champion chess player, I was intrigued. Garry Kasparov battled IBM’s Deep Blue supercomputer in 1996 and won, however he eventually lost a rematch in 1997. Well, IBM is back at it, this time taking on Jeopardy. Nova takes us behind the scenes with the developers of “Watson,” the next step in AI. I was disappointed when the episode ended and it didn’t say who won. I didn’t realize until logging on PBS.org that the contest actually was taking place while I was watching Nova (on my media center PC). After some frantic Google searches, I eventually came across a Twitter feed with a link to a Youtube posting of the episode. This was not quite 2 hours after the episode aired! Isn’t technology great? I expect the Youtube post to be served a DMCA take down, so watch it soon if you plan on it. In addition to the episode at the end of this post, I’ve embedded the Nova preview and an humorous parody of the challenges Watson overcame during his development. I suggest watching the Nova episode first. If you are at all interested in AI, you must check these out!
There are two more nights to the match, airing Tuesday February 15th, and Wednesday the 16th. Be sure to check them out, along with some live blogging on PBS.org. I find myself rooting for Watson, not because I want to see humans defeated, but because I want to see humans capable of making something smart enough to do it. Who do you think will win? Who do you want to win?
A few months ago a co-worker of mine suggested that I read The Age of Spiritual Machines: When Computers Exceed Human Intelligence by Ray Kurzweil. We had been talking about AI and he mentioned that this was an interesting read. I wasn’t sure exactly what to expect, as I had never heard of Kurzweil before. After a few Google searches I got the impression that he was a quirky futurist.
This book was published back in 1999 and by the end looks very much like science fiction. Many of his predictions are founded on some sort of research. I can see how they would have seemed a bit “out there” almost 10 years ago. I wondered how many of his predictions would hold up. Central to his philosophy is the Law of Accelerating Returns. In short, technology will continue to progress ever faster as time goes on. He displays an interesting graph of the exponential increase of computational power in various models of computers over time. The line is slightly curved upward, which represents an increase in exponential growth over time. So, according to Kurzweil computation is progressing exponentially exponentially faster. (more…)