Automatability: The Proof Search Problem

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


Duration: 1:00:55
715 views
12

Susanna de Rezende (Lund University)
https://simons.berkeley.edu/talks/automatability-proof-search-problem
Meta-Complexity Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2023-02-02The Power of Randomness in Kolmogorov Complexity
2023-01-28Emulating Non-Local Games with Cryptography
2023-01-28Is Cryptography Feasible if P=NP?
2023-01-28Proof Complexity and TFNP
2023-01-28Learning versus Proofs of Complexity Lower Boundes
2023-01-27Understanding the Role of Derandomization in TCS
2023-01-27New Forms of Hardness versus Randomness
2023-01-27Quantum for Science
2023-01-27Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
2023-01-27The Power of Randomness in Kolmogorov Complexity
2023-01-21Automatability: The Proof Search Problem
2023-01-21Proofs, Circuits and Total Search Problems
2023-01-21Proof Complexity and Meta-Complexity Tutorial (2)
2023-01-20Proof Complexity and Meta-Complexity Tutorial (1)
2023-01-20Minimal Complexity Assumptions for Cryptography (Part II)
2023-01-20Minimal Complexity Assumptions for Cryptography (Part I)
2023-01-20Cryptography and Kolmogorov Complexity (Part II)
2023-01-19Cryptography and Kolmogorov Complexity (Part I)
2023-01-19The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part II)
2023-01-19The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part I)
2023-01-19Probabilistic Kolmogorov Complexity


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meta-Complexity Boot Camp
Susanna de Rezende