The Probably Approximately Correct Learning Model in Computational Learning Theory This survey paper gives an overview of various known results on learning classes of Boolean functions in Valiant's Probably Approximately Correct (PAC) learning model and its commonly studied variants...

How did I miss this?! A recent (2025) survey by Rocco Servedio on PAC learning and its variants, and recent results in these learning models:

arxiv.org/abs/2511.08791

(Anything by Rocco is worth reading!)

Excited about this new paper: it subsumes the quadratic Goldreich-Levin [BC26] and algorithmic PFR [ACDG26] papers, and makes explicit a connection between quadratic Fourier analysis and symplectic geometry, as speculated by Green and Tao.
arxiv.org/abs/2604.04547

Thanks for making everything available online! Can’t wait to watch the lectures.

Submissions are now open for RANDOM 2026: easychair.org/conferences/...

Call for papers: randomconference.com/random-2026-...

RANDOM 2026 will be held in Boston, MA, on August 19–21, 2026, together with APPROX 2026.

We look forward to your submissions!

TCS+ RSVP: Rahul Ilango (2026/04/08) Gödel in Cryptography: Zero-Knowledge Proofs With No Interaction, No Setup, and Perfect Soundness

📢 Our next TCS+ talk of the season will be Wednesday, April 8 (10am PT, 1pm ET, 19:00 CEST): Rahul Ilango, from MIT, will tell us about Gödel in Cryptography!

RSVP to receive the link (available one day prior to the talk): docs.google.com/forms/d/e/1F...

Postdoc position in Cambridge with the amazing Anuj Dawar!

Group and semigroup puzzles and a possible Polymath project An Artin-Tits group is a group with a finite set of generators $latex a_1,\dots a_k$ in which every relation is of the form $latex (ab)^r=(ba)^r$ or $latex (ab)^ra=(ba)^rb$ for some positive intege…

I've created a couple of mathematical games, both based on word problems in groups or semigroups. One of them could lead to a Polymath project if enough people are interested in it, as it is connected with an open problem. More details in the linked blog post.

Happy days! A perfect excuse to share my favourite quantum cryptography origin story, as recounted in Brassard’s paper:
arxiv.org/pdf/quant-ph...

A quantum computer here at Cambridge!

Plus, you’ve gotta love the leaderboards!

The Lens of Abelian Embeddings We discuss a recent line of research investigating inverse theorems with respect to general k-wise correlations, and explain how such correlations arise in different contexts in mathematics. We outlin...

I’ve been enjoying Dor Minzer’s new survey “The Lens of Abelian Embeddings”. It gives a clear, additive-combinatorics-flavoured perspective on inverse theorems for k-wise correlations, with applications in discrete maths/TCS and plenty of open problems. arxiv.org/abs/2602.22183

Postdoctoral Research Associate (Fixed Term) at University of Cambridge Explore an exciting academic career as a Postdoctoral Research Associate (Fixed Term). Don't miss out on other academic jobs. Click to apply and explore more opportunities.

Postdoc position in Cambridge with Julia Wolf:

Julia is a phenomenal researcher and a wonderful collaborator. She is advertising a 2-year postdoc in additive combinatorics and model theory.

Closing date: 16 March. Details: jobs.ac.uk/job/DQP803/postdoctoral-research-associate-fixed-term

The 2nd Quantum Cambridge–Oxford–Warwick (QCOW) Workshop will take place at Warwick on April 23–24. Theme: Quantum Learning Theory. The programme will feature tutorials and accessible in-depth talks on recent advances by leading experts. Speakers/updates:
qcow.cs.ox.ac.uk/

I’m tempted to order it too. Let me know if you enjoy the exposition

Congrats to ToC for having you!

The list of accepted papers at #STOC2026 is out:
acm-stoc.org/stoc2026/acc...

Congratulations to all authors!

Theoretical CS community! I have a small favor to ask. If you ever used, read, watched some of the (excellent IMO) exposition content by Ryan O'Donnell, would you mind filling this very short survey, and maybe say how useful to you it was?

📝 forms.gle/xrvc2mLRbMqK...

Please spread this! #TCSSky

A *very* enthusiastic yes for both!

Thanks for sharing! I would have missed this gem if not for your crisp expository note.

Congrats to Irit Dveer Dinur of the Institute for Advanced Study & Weizmann Insitute, #NASmember Subhash Khot of New York University, Guy Kindler of @hebrewuniversity.bsky.social, Dor Minzer of @mit.edu, and Muli Safra of Tel Aviv University, winners of the 2026 Michael and Sheila Held Prize! (1/2)

ICALP 2026 CFP is out.
This year it’ll be at Royal Holloway (London area), July 7–10, 2026.
Abstract registration: Feb 3
Paper deadline: Feb 6
Details: icalppodcspaa2026.cs.rhul.ac.uk/icalp/

General Relativity - YouTube

I strongly recommend Tobias Osborne's lectures on general relativity. They are full of insight and lots of fun to watch.
www.youtube.com/playlist?lis...

Would you recommend Open World?

Thanks! It depends for which object. For RLDCs, we have this lower bound: eccc.weizmann.ac.il/report/2025/...

For PCPPs and dPCPs, in general that’s a big open problem, but one can view c^3 LTCs as codes augmented with PCPPs.

New paper with the brilliant Dor Minzer, Guy Weissenberg, and Kai Zhe Zheng: we show a separation between RLDCs and LDCs via HDX-based PCPs. This one is special to me; it answers a question Oded Goldreich posed to me in my 1st PhD year, and it’s been on my mind ever since.
arxiv.org/pdf/2512.129...

Reminder: Two weeks left to apply for the Assistant/Associate Professor positions in Theoretical Computer Science at Cambridge.

Application deadline: 15 December 2025.

Details and application portal:
cst.cam.ac.uk/assistantass...

Wow! Yuansi Chen resolves 1 of the 2 remaining $1000 Talagrand problems (michel.talagrand.net/prizes/prize... ):

If you take any f : {-1,+1}ⁿ → ℝ⁺ and apply the noise operator T_{.99}, the resulting function g = T_{.99} f satisfies a better-than-Markov inequality. That is, Pr[g > t E[g]] < o(1/t).

A new paper with the brilliant Guy Goldberg and Sidhant Saraogi (now on the job market!). We prove nearly tight lower bounds for relaxed LDCs via a new combinatorial notion of relaxed sunflowers with pseudorandom structure, obtained from new spread lemmas.

eccc.weizmann.ac.il/report/2025/...

Join us for the first Quantum Cambridge–Oxford–Warwick Colloquium (Quantum COW, if you insist...), 11–12 December 2025 at the University of Oxford.

This meeting focuses on Quantum Low-Depth Complexity, with talks, tutorials, and open discussions.

Details: qcow.cs.ox.ac.uk

Reminder: the School of Computer Science at #USyd is hiring across the board, equiv. tenure-track positions!

Join us at @sydney.edu.au! Deadline ⏰ December 1 🇦🇺