Complexity and Computability with Closed Timelike Curves

Name: Complexity and Computability with Closed Timelike Curves
Uploaded: 2019-05-13T07:00:01.000Z
Duration: 1 h 1 min 37 s
Channel: Scott Aaronson
Description: Scott Aaronson investigates the theoretical implications of closed timelike curves on computational complexity and computability, exploring the boundaries of what…

Scott Aaronson

Graduate Mathematics·Scott Aaronson

1:01:37

Notebook

Write a note below at any timestamp, paste a slide screenshot (⌘V), or toggle the Lecture Guide to keep key slides and equations.

Complexity and Computability with Closed Timelike Curves

Scott Aaronson Graduate Mathematics

1:01:37·2019·graduate·Public Lecture

Scott Aaronson investigates the theoretical implications of closed timelike curves on computational complexity and computability, exploring the boundaries of what is knowable and computable.

Theory & Algos Physics Computational Complexity Quantum Mechanics Turing Machines & Decidability Entanglement & Quantum Information Special & General Relativity Time Travel Paradoxes

About the lecturer

Speaker directory →

Scott Aaronson

Speaker at Graduate Mathematics

Scott Aaronson is a distinguished Professor of Computer Science at the University of Texas at Austin, a leading authority in quantum computing and computational complexity theory.

1 lecture in archiveView profile