Computational Complexity and Quantum Compuation

Cool some more video's I probably don't have time to watch but interesting nonetheless!
Computational complexity is the study of what resources, such as time and memory, are needed to carry out given computational tasks, with a particular focus on lower bounds for the amount needed of these resources. Proving any result of this kind is notoriously difficult, and includes the famous problem of whether P = N P . This course will be focused on two major results in the area. The first is a lower bound, due to Razborov, for the number of steps needed to determine whether a graph contains a large clique, if only “monotone” computations are allowed. This is perhaps the strongest result in the direction of showing that P and N P are distinct (though there is unfortunately a very precise sense in which the proof cannot be developed to a proof of the whole conjecture). The second is Peter Shor’s remarkable result that a quantum computer can factorize large integers in
polynomial time

Mathematicians Prove Tetris Is Tough

No wonder I never really liked Tetris LOL!
I figured it was a hard game but Minesweeper is NP-hard too and I like to play that though?
Mathematicians Prove Tetris Is Tough

Apple job of the day

Web Developer, iPhone/iPod Touch

Requirements:

• 4 year computer science/software engineering degree or equivalent work experience.
• Professional web application development experience.
• Experience with Ruby, PHP and JavaScript.
• Experience designing and implementing browser-based user interfaces using AJAX, ReST, and/or JSON.
• Relational Database experience with one of the following: SQLite, MySQL, Postgres or Oracle.
• Experience with Unix shell scripting (bash/sh/csh).
• Mac OS X & iPhone development (Objective-C) experience is a plus.

Am I In the Wrong Degree Program?

A degree program that you enjoy is the right program for you

Google's Go

Big news for developers out there: Google has just announced the release of a new, open sourced programming language called Go. The company says that Go is experimental, and that it combines the performance and security benefits associated with using a compiled language like C++ with the speed of a dynamic language like Python. Go’s official mascot is Gordon the gopher, seen here.
Sounds cool but they need a Windows version since it seems to be Linux and Mac only for the moment.

Finding shortest path

Good explanation:
Finding the shortest route

13 Tools for Building Your Own iPhone App

If you don't want to go to all the trouble of learning Objective-C here's some alternatives:
These days, everyone wants to build their own iPhone applications, but not everyone knows how write the code necessary in order to create them. Fortunately, there are now a number of tools that allow non-developers the ability to create their own iPhone apps without knowing programming or scripting.

Visual Studio 2008 for Gaming: Developing 3D Games

Some more video's I found:
Welcome to Visual Studio for gaming, how to get started developing 3D games. The purpose of this session is to provide an overview and introduction to developing games that are 3D using XNA Game Studio. To do that I’ve broken the session into three distinct components: The graphics, where we’ll talk about models and meshes, textures and shaders; The math, where we’ll try to wrap our heads around 3D space and the 3D pipeline; and finally The game itself, and that is the object model of the XNA Framework and what it looks like to manipulate the graphics and the math in the game that you create using XNA Game Studio.

What Every Computer Scientist Should Know About Floating-Point Arithmetic

This was probably one of the most difficult concepts in my Computer Architecture class so I'm not suprised there is some confusion:
Floating-point arithmetic is considered an esoteric subject by many people. This is rather surprising because floating-point is ubiquitous in computer systems. Almost every language has a floating-point datatype; computers from PCs to supercomputers have floating-point accelerators; most compilers will be called upon to compile floating-point algorithms from time to time; and virtually every operating system must respond to floating-point exceptions such as overflow. This paper presents a tutorial on those aspects of floating-point that have a direct impact on designers of computer systems. It begins with background on floating-point representation and rounding error, continues with a discussion of the IEEE floating-point standard, and concludes with numerous examples of how computer builders can better support floating-point.

PowerShellPack

Introducing the Windows 7 Resource Kit PowerShell Pack

Game Programming with Silverlight

Fun stuff!