Playing The Video At the bottom right of the above picture, There is a hyperlinked caption. Click on it to play the video. Talk Abstract If people thought of something fascinating about computers, Then it would usually be about some fancy practical application.
When we started this class I told you it would be a hard class. So, I did not fool you for sure. Mathematics is always difficult to learn and it takes alot of work –prof. R. Elman
The most beautiful moment I have felt while working on this problem was when a pure deductive reasoning yielded a reasonable approach, which in turn yielded a logic-based established truth
Yet, On a heroic movement, Computer scientists attempt to engineer superposition states, Whereby a probabilistic measurement outcome, Enables them to conclude answers to algorithmic problems!
Yet, Another NP-Complete Problem. Kleinberg and Tardos' exercise 38 of their algorithm design book
Challenging my self to prove its correctness via formal logic
Not based on fancy algorithms or data structures