Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • Make a Gift
Berkeley University of California
Home Home

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Ways to Participate
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Plan Your Visit
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About
Homepage lighter banner test 4

Simons Institute for the Theory of Computing

Upcoming events alert bar

Next:
Mar. 20 – 24, 2023

Proof Complexity and Meta-Mathematics

View

Upcoming Events

Workshops & Symposia Internal Program Activities Public Lectures
All Workshops & Symposia
Workshops & Symposia
Proof Complexity and Meta-Mathematics
Meta-complexity_logo_hi-res
Mar. 20 – 24, 2023
Proof Complexity and Meta-Mathematics
Program
Meta-Complexity
Details of Proof Complexity and Meta-Mathematics View Schedule
ToniCS: Celebrating the Contributions and Influence of Toniann Pitassi
Satisfiability_hi-res-logo
Mar. 27 – 29, 2023
ToniCS: Celebrating the Contributions and Influence of Toniann Pitassi
Program
Extended Reunion: Satisfiability
Details of ToniCS: Celebrating the Contributions and Influence of Toniann Pitassi View Schedule
Satisfiability: Theory, Practice, and Beyond
Satisfiability_hi-res-logo
Apr. 17 – 21, 2023
Satisfiability: Theory, Practice, and Beyond
Program
Extended Reunion: Satisfiability
Details of Satisfiability: Theory, Practice, and Beyond
All Internal Program Activities
Other Events
CS Conversations Meta-complexity_Satisfiability Combined Logo
Wednesday, Mar. 22, 2023 | 5 – 6 p.m.
CS Conversations
Program
Meta-Complexity
Details of CS Conversations
CS Conversations Meta-complexity_Satisfiability Combined Logo
Wednesday, Mar. 22, 2023 | 5 – 6 p.m.
CS Conversations
Program
Extended Reunion: Satisfiability
Details of CS Conversations
Music Night Meta-complexity_Satisfiability Combined Logo
Wednesday, Mar. 22, 2023 | 6:30 – 8:30 p.m.
Music Night
Program
Meta-Complexity
Details of Music Night
All Public Lectures
Quantum Colloquium — Efficient Quantum Gibbs Samplers
Tuesday, Mar. 21, 2023 | 11 a.m. – 1 p.m.
Quantum Colloquium — Efficient Quantum Gibbs Samplers
Speaker: Chi Fang (Anthony) Chen (Caltech)
Details of Quantum Colloquium — Efficient Quantum Gibbs Samplers
Theoretically Speaking — Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT Theoretically Speaking — Building Human Intelligence at Scale, To Save the Next Generation From ChatGPT Web Image
Tuesday, Apr. 4, 2023 | 6 – 7:30 p.m.
Theoretically Speaking — Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT
Speaker: Po-Shen Loh (Carnegie Mellon University)
Details of Theoretically Speaking — Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT
Richard M. Karp Distinguished Lecture — Gödel and the Vicious Circle: On the (In)Feasibility of Lower Bounds RMK KARP WALL DISPLAY CROPPED
Tuesday, Apr. 11, 2023 | 4 – 5 p.m.
Richard M. Karp Distinguished Lecture — Gödel and the Vicious Circle: On the (In)Feasibility of Lower Bounds
Speaker: Rahul Santhanam (University of Oxford)
Details of Richard M. Karp Distinguished Lecture — Gödel and the Vicious Circle: On the (In)Feasibility of Lower Bounds
News
All News
In Neural Networks, Unbreakable Locks Can Hide Invisible Doors
In Neural Networks, Unbreakable Locks Can Hide Invisible Doors

From Quanta Magazine: Cryptographers have shown how perfect security can undermine machine learning models.

Read In Neural Networks, Unbreakable Locks Can Hide Invisible Doors
Mar. 6, 2023
Theory at the Institute and Beyond, February 2023
An illustration of a laptop computer displaying a chart that lists five possible complexity-theoretic worlds: Algorithmica, Heuristica, Pessiland, Minicrypt, and Cryptomania
Theory at the Institute and Beyond, February 2023
This semester at the Simons Institute, the Meta-Complexity program is buzzing along with intense activity in the...
Read about Theory at the Institute and Beyond, February 2023
Feb. 28, 2023
Letter from the Director, February 2023
Letter from the Director, February 2023

Greetings from Berkeley, where February is a mixture of glorious spring blossoms and surprise snow flurries.

Read about Letter from the Director, February 2023
Feb. 28, 2023
Current Programs
All programs
Meta-Complexity
Meta-complexity_logo_hi-res
Jan. 10 – May 12, 2023

Meta-Complexity

Explore about Meta-Complexity
Organizers
+2
Valentine Kabanets, Rafael Pass and 3 more
Explore about Meta-Complexity
Jan. 10 – May 12, 2023
Research Pods

Machine Learning Research Pod

Machine Learning Research Pod

Learn more about

Machine Learning Research Pod

Organizers
+5
Dennis Shen, Andrea Zanette and 6 more
Learn more about

Machine Learning Research Pod

Quantum Research Pod

Quantum Research Pod

Learn more about

Quantum Research Pod

Organizers
+5
Torin Stetina, Nilin Abrahamsen and 6 more
Learn more about

Quantum Research Pod

Future Programs

Analysis and TCS: New Frontiers

Analysis and TCS_hi-res_logo
May 30 – Aug. 4, 2023

Analysis and TCS: New Frontiers

Summer Cluster on Quantum Computing

Summer Cluster on Quantum Computing Logo
June 12 – Aug. 4, 2023

Summer Cluster on Quantum Computing

Logic and Algorithms in Database Theory and AI

Aug. 16 – Dec. 15, 2023

Logic and Algorithms in Database Theory and AI

Data Structures and Optimization for Fast Algorithms

Aug. 16 – Dec. 15, 2023

Data Structures and Optimization for Fast Algorithms

Error-Correcting Codes: Theory and Practice

Jan. 9 – May 10, 2024

Error-Correcting Codes: Theory and Practice

Quantum Algorithms, Complexity, and Fault Tolerance

Jan. 9 – May 10, 2024

Quantum Algorithms, Complexity, and Fault Tolerance

SimonsTV
All Videos

What Do the Theory of Computing and the Movies Have in Common?

Watch What Do the Theory of Computing and the Movies Have in Common? Opens in a new tab

How Complex Is Complexity? Or What’s a ‘Meta’ for?

Watch How Complex Is Complexity? Or What’s a ‘Meta’ for? Opens in a new tab

The Dawn of Computational Complexity Theory

Watch The Dawn of Computational Complexity Theory Opens in a new tab
Mar. 11, 2021

Cryptography and Kolmogorov Complexity (Part I)

Watch Cryptography and Kolmogorov Complexity (Part I) Opens in a new tab
Other announcements
COVID-19 Update

You should not come to campus if you have had any new and unusual symptoms of COVID-19 (not attributed to a previously known medical condition) in the last 24 hours. When on campus, masks are strongly recommended. Visitors are required to acquire masks for their daily use. A limited supply of masks are available at the institute for those who forget to bring a mask. 

If you test positive, follow the campus procedures described here. Note that visiting researchers should follow staff guidelines.

Visitors are responsible for acquiring COVID tests for their personal use. The Institute has a limited number of COVID tests available for workshop speakers only. 

Participate

We are now accepting applications for Simons Quantum Postdoctoral Fellowships.

More information on how to participate in the life of the Institute. 

 

 

Spring 2023 Classes
  • CS 294-236, Cryptography in a Quantum World, Umesh Vazirani, co-instructor Fermi Ma, (Mondays 2–5 p.m., Hearst Mining 410)
  • CS 294-92, Analysis of Boolean Functions, Avishay Tal (Tuesdays/Thursdays 12:30p-2:00p.m., Soda 306)
COVID-19 Update

You should not come to campus if you have had any new and unusual symptoms of COVID-19 (not attributed to a previously known medical condition) in the last 24 hours. When on campus, masks are strongly recommended. Visitors are required to acquire masks for their daily use. A limited supply of masks are available at the institute for those who forget to bring a mask. 

If you test positive, follow the campus procedures described here. Note that visiting researchers should follow staff guidelines.

Visitors are responsible for acquiring COVID tests for their personal use. The Institute has a limited number of COVID tests available for workshop speakers only. 

Participate

We are now accepting applications for Simons Quantum Postdoctoral Fellowships.

More information on how to participate in the life of the Institute. 

 

 

Spring 2023 Classes
  • CS 294-236, Cryptography in a Quantum World, Umesh Vazirani, co-instructor Fermi Ma, (Mondays 2–5 p.m., Hearst Mining 410)
  • CS 294-92, Analysis of Boolean Functions, Avishay Tal (Tuesdays/Thursdays 12:30p-2:00p.m., Soda 306)

Subscribe

Simons Institute news and events
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • About
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2023 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Ways to Participate
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Plan Your Visit
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • Make a Gift
link to homepage