Wednesday, December 20, 2023

2023 Complexity Year in Review

Result of the year goes to 

Polynomial-Time Pseudodeterministic Construction of Primes
Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren and Rahul Santhanam

An impressive year for complexity and we wrote several theorem posts this year including the one above, new Ramsey bounds, exponential circuit bounds for \(\Sigma_2^E\), inverting compression functions and advances in group isomorphism

It's a year dominated by wars, Taylor Swift, ChatGPT and mathematicians Leaning in. The blog word of the year is meta-complexity.

We remember Jimmy BuffettMartin Davis, Neil JonesAbraham LempelGordon MooreRoger Schank, Vera SósWilliam WulfJacob Ziv and Dilbert. Happy to forget Ted Kaczynski

Thanks to our guest posters Eric Allender, Ravi BoppanaJosh Grochow, and Youming Qiao.

Enjoy the holidays and we'll see you in 2024.

1 comment:

  1. Just to inform, Google Bard will be a big problem for OpenAI ChatGPT. Which will become more popular and take the lead in 2024?

    ReplyDelete