Halt? Computable?
The class focused on the topic of halting and computability. At first, it seemed weird when you come across the fact that when a program halts, it doesn't halts and when a program doesn't halts, it halts. Though, later I realized it wasn't that bad as it seemed at the first look. This video made it a lot simpler for me:
We also covered some more over the Big O and Big Omega proofs, followed by some proofs involving theta, which weren't too bad to be frank. I guess, this weeks tutorial made it a lot clearer to me about these proofs.
Nice SLOG. The video was really helpful in understanding halting which took me a while to grasp the concept for!
ReplyDelete