Foundations of Computing: Scott Aaronson | Polylogues

Foundations of Computing: Scott Aaronson | Polylogues

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=-fK4nmTlfx0


Duration: 45:34
1,875 views
48

A theoretical computer scientist at the University of Texas at Austin, Scott Aaronson conducts research in quantum computing and computational complexity.

For this episode of Polylogues, Simons Institute Journalist in Residence Siobhan Roberts sat down with Aaronson to discuss the history of computer science and his trajectory in the field — especially in quantum computing.



Other Videos By Simons Institute for the Theory of Computing


2021-12-08Universality of Neural Networks
2021-12-08The Spectrum of Nonlinear Random Matrices for Ultra-Wide Neural Networks
2021-12-08Exact Asymptotics and Universality for Gradient Flows and Empirical Risk Minimizers
2021-12-07Learning Staircases
2021-12-07Sharp Matrix Concentration
2021-12-07Non-Parametric Convergence Rates for Plain Vanilla Stochastic Gradient Descent
2021-12-07Self-Training Converts Weak Learners to Strong Learners in Mixture Models
2021-12-07Graphon Neural Networks and the Transferability of Graph Neural Networks
2021-12-07Adaptive Wavelet Distillation from DNNs and Dictionary Learning
2021-12-06Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting
2021-12-06Foundations of Computing: Scott Aaronson | Polylogues
2021-12-04Equivariant Machine Learning Structured Like Classical Physics
2021-12-03Equivariant RL
2021-12-03Symmetry Adapted Gram Spectrahedra
2021-12-03Optimization On Tensor Network Varieties
2021-12-02On The Polyhedral Geometry Of Pivot Rules
2021-12-02Matrix Multiplication, And The Asymptotic Spectrum Of Tensors
2021-12-02The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
2021-12-02Two Tensor Optimization Problems From Quantum Information
2021-12-01Complexity Of Computing Complex Zeros Of Structured Polynomial Systems
2021-12-01Groups And Symmetries In Statistical Models


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing