Quantum Machine Learning 04: Kolmogorov Complexity of Boolean functions

This video explained how to get a good approximation for the uncomputable Kolmogorov Complexity of a Boolean function. I demonstrated how to get the Binary Decision Diagram of a Boolean function step by step. And I also briefly introduced Turing machine.