I have to agree with you guys to a point, the ideas behind it are pretty interesting and the consequences if P = NP. it is just when all the maths and proofs get going that i switch off!
TheHeadFL - Have you looked at busy beaver functions. These are functions that grow faster than the largest function and so are non computable. i personally found it kind of hard to get my head round to start with.