Skip to content

Archive

Home Browse Courses Talks Playlists

Directory

Institutions Speakers Concepts

Library

Playlists

SpeakersScott Aaronson

⌘K

/

/

Faculty & Researcher Profile

Scott Aaronson

Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin

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.

1standalone talk·1total lecture·1hrecorded

GMGraduate Mathematics Algorithms & Theoretical CS Physics & CosmologyWebsite Google Scholar

Education & Doctoral Lineage

PhD, University of California, Berkeley
Cornell University

Appointments & Career

Schlumberger Centennial Chair of Computer Science, University of Texas at Austin
Professor, Massachusetts Institute of Technology
Institute for Advanced Study
University of Waterloo

Intellectual Web & Academic Lineage · Scott Aaronson

7 connections

Verified alma mater degrees, faculty appointments, co-authors, doctoral lineage, and intellectual peers across the archive.

Alma Materinstitution

6 courses · 96 lectures

PhD, University of California, Berkeley

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Alma Materinstitution

University of California

1 lectures

PhD, University of California, Berkeley

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Faculty Appointmentinstitution

Graduate Mathematics

2 lectures

Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Faculty Appointmentinstitution

Institute for Advanced Study

5 courses · 95 lectures

Institute for Advanced Study

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Faculty Appointmentinstitution

46 courses · 929 lectures

Professor, Massachusetts Institute of Technology

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Faculty Appointmentinstitution

University of Waterloo

3 lectures

University of Waterloo

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Alma Materinstitution

Cornell University

5 courses · 48 lectures

Cornell University

Computational complexity theory Quantum computing Quantum Computing Algorithms and Architecture

Standalone talks by Scott Aaronson

1

Self-contained public lectures, keynote addresses, and research seminars.

Complexity and Computability with Closed Timelike Curves

Theory & Algos·Public Lecture

Complexity and Computability with Closed Timelike Curves

Scott Aaronson·GMGraduate Mathematics

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