Has the Chicago Professor cracked P=NP

Via Sarada: Professor Babai of the University of Chicago recently made an alleged breakthrough in theoretical computer science which concerns the problem of graph isomorphism. In lecture, we have often been told that there are massive networks in biology and social media, to only name two areas, that can not be effectively visualized because of the sheer mass of links and nodes; these networks can grow to be so convoluted that computers occasionally have a difficult time telling if two networks are, in fact, identical or not in an acceptably short time.

Pure vs. Applied Mathematician

Via Wired : A pure mathematician, when stuck on the problem under study, often decides to narrow the problem further and so avoid the obstruction. An applied mathematician interprets being stuck as an indication that it is time to learn more mathematics and find better tools.

Quote for the day

“You say I am repeating Something I have said before. I shall say it again. Shall I say it again? In order to arrive there, To arrive where you are, to get from where you are not, You must go by a way wherein there is no ecstasy. In order to arrive at what you do not know You must go by a way which is the way of ignorance.