This semester, Prof. Arvind is offering a lecture series on the issues related to randomness and hardness, extractors, expanders and error correcting codes. Last 5 lectures he has been talking about randomness and hardness. For the first time I have had such a great introduction to the topic. I shall now write a small summary of few issues discussed during these lectures. But only techinical issues are infact from the lecture. All the other junk is self cooked, so please excuse Arvind if any errors below. First of all why should one try to relate randomness and hardness? Lets eavesdrop on the following conversation. A: You are always doing something unexpected B: Why what happened...? A: I mean, "knowing you so long" I felt you would have said 'yes' to join for picnic...but you are "truly random" B: truly random?? A: yes, very very "hard" for me to predict.. As is evident, 'random' and 'hard to predict' are almost synonymous phrases...