Am I any longer a Geek?

One of my favorite Wodehouse title is Carry On, Jeeves, a collection of short stories. The first story, Jeeves Takes Charge, introduces us to Bertie and Jeeves and tells the story of how Jeeves came to be Bertie's boss, I mean valet. In this story, Bertie is engaged to the autocratic but beautiful Lady Florence, who wants to improve his mind by feeding him a book titled Types of Ethical Theory that contained this memorable prose.

Of the two antithetic terms in the Greek philosophy one only was real and self-subsisting; and that one was Ideal Thought as opposed to that which it has to penetrate and mould. The other, corresponding to our Nature, was in itself phenomenal, unreal, without any permanent footing, having no predicates that held true for two moments together; in short redeemed from negation only by including indwelling realities appearing through.

Right Ho. Naturally Bertie's engagement did not last much longer. I found this to be a funny story without paying anymore attention to it.

Recently I saw that my friend had posted on Facebook a comment on NP-Complete problems and remembered reading about this in graduate school decade and a half ago and actually doing well enough to get an A on that course. Since I no longer knew what it was, I looked my favorite source, The Wikipedia and, I kid you not, this was what I read.

In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems so that any given solution to the decision problem can be verified in polynomial time, and also in the set of NP-hard problems so that any NP problem can be converted into L by a transformation of the inputs in polynomial time.

Quite lucid you say

I on the other hand am no longer feel smart enough to comprehend such material.