Halting Problem & Quantum Entanglement 2020 Breakthrough result [MIP*=RE]

This video explains the MIP*=RE result. We skip the proof details, just explain what the result means. Please leave comments in the comment section if something is unclear. The links mentioned in the video: 1) Proof that the halting problem can’t be solved: 2) Using the entanglement: TBA in a few weeks. In the meantime you can watch a general primer to quantum physics: 3) Proof that PSPACE contains P and is contained in EXP: TBA in a few weeks. Chapters: 0:00 Part 1: Decision problems 3:13 Part 2: Complexity classes 7:32 Part 3: Verification 12:57 Part 4: More verification power 17:51 Part 5: Some implications Some more explanations: Part 3: * We require the verifier to run in polynomial time. This has the usual definition with respect to the input’s size. This constraints the size of the proof sent by the prover, since reading 1 character costs 1 time unit. * In the video we make a distinction between honest and malicious provers. Sometimes