It has been a long time since I last posted, but now I come with a new problem that I recently learned about. As you can imagine it's called the N vs NP problem, and is essentially asking the question whether every problem whose solution can be quickly verified can also be solved quickly. And this obviously relates to computer science, because computers need to right away know how long the calculation will take. And this problem I think I am going to try using examples. Take
Get in Touch
I’d love to hear from you! Please send me a note or comment.