filmov
tv
A Tale of Turing Machines, Quantum-Entangled Particles, and Operator Algebras
Показать описание
Henry Yuen (University of Toronto)
Richard M. Karp Distinguished Lecture Series, Spring 2020
In a recent result known as "MIP* = RE," ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 44-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, I will describe the evolution and convergence of ideas behind MIP* = RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.
This talk is aimed at a general scientific audience, and will not assume any specialized background in complexity theory, quantum physics, or operator algebras.
Richard M. Karp Distinguished Lecture Series, Spring 2020
In a recent result known as "MIP* = RE," ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 44-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, I will describe the evolution and convergence of ideas behind MIP* = RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.
This talk is aimed at a general scientific audience, and will not assume any specialized background in complexity theory, quantum physics, or operator algebras.
A Tale of Turing Machines, Quantum-Entangled Particles, and Operator Algebras
Turing machines explained visually
Turing Machines - How Computer Science Was Created By Accident
ICPCU by Henry Yuen: A Tale of Turing Machines, Quantum-Entangled Particles, and Operator Algebras
The Betrayal of Alan Turing
Are There Problems That Computers Can't Solve?
Alan Turing: Crash Course Computer Science #15
THIS 1936 Paper Theorized the FIRST Computer EVER, by Alan Turing
How was Alan Turing Able to Crack the Enigma Code?
Alan Turing - History Who's Who
Alan Turing - betrayed by the country he saved
Alan Turing and the Enigma
Alan Turing: The Scientist Who Saved The Allies | Man Who Cracked The Nazi Code | Timeline
The Turing test: Can a computer pass for a human? - Alex Gendler
A Tale of 2 Turing Machines
How did the Enigma Machine work?
Alan Turing 'On Computable Numbers, with an Application to the Entscheidungsproblem' 1936 ...
The Only Working Turing Machine There Ever Was Probably | The Henry Ford's Innovation Nation
Alan Turing’s Bombe machine at Bletchley Park.
Life of Alan Turing and the Turing Machine - History of Computers - Made For Students by Students
Math's Fundamental Flaw
The real story of how Enigma was broken - Sir Dermot Turing
6. TM Variants, Church-Turing Thesis
How Enigma was cracked
Комментарии