#TheoreticalCS
First post on 🦋 network. Greetings everyone. If you are interested in #machinelearning #deeplearning #dynamicalsystems #appliedmath #theoreticalcs, let's connect.
November 27, 2024 at 11:15 AM
Join us at Bletchley Park this 16–18 Sept for Computable 90!

Hear why our team can't wait for this landmark event celebrating Alan Turing's legacy.

Watch: youtu.be/5c5zuOJDWlI

ECR bursaries available—please RT & share!
#AlanTuring #ComputerScience #TheoreticalCS #Maths #AI #BletchleyPark
Computable 90 Mike's preview
YouTube video by MissCellarKnee
youtu.be
August 13, 2026 at 3:37 PM
Update: we now have a full line-up for the 2 Inspirational and 6 Rising Star talks at our pre #FOCS2025 "Celebration of #TheoreticalCS" event at 🇦🇺 #USyd!

More info (and free registration): sites.google.com/view/celebra...

Travel support (deadline ⏰ Sep 19 AoE): sites.google.com/view/celebra...
September 15, 2025 at 1:54 PM
And that's a wrap for the semester! All the talks of the season are now available on our website:
sites.google.com/view/tcsplus...
and YouTube channel:
www.youtube.com/@TCSplusSemi...

Thank you to all attendees, and to our wonderful speakers—and see you in the Fall! #TCSSky #TheoreticalCS
May 21, 2026 at 5:11 AM
“The Gödelian Constraint on Epistemic Freedom (GCEF)”
A topological theory of embedded cognition, simulation occlusion, and unsolvable problems.

Read the paper → zenodo.org/record/15875...

#epistemology #cognition #theoreticalCS #AIalignment #philosophy #complexity #simulation #embeddedagency
Gödelian Constraint on Epistemic Freedom (GCEF): A Topological Theory of Embedded Cognition and Epistemic Singularities
This preprint proposes the Gödelian Constraint on Epistemic Freedom (GCEF), a unifying theoretical framework for understanding why certain problems across mathematics, cognition, physics, and artifici...
zenodo.org
July 17, 2025 at 12:58 AM
Theoretical study showing promise problems behave fundamentally differently from languages in relativized settings. Improves upper bound on Quantum-Classical Polynomial Hierarchy and proves self-lowness of PromiseBQP under robust oracle access.

#QuantumComplexity #TheoreticalCS #Research
Promise Problems and Relativization in Quantum Complexity Theory
arxiv.org
September 9, 2026 at 7:40 PM
Solving this could revolutionize cryptography, algorithms, and AI, shaping technology and security for decades. #TheoreticalCS #PvsNP
December 16, 2025 at 8:38 PM
This matters because it deepens our grasp of foundational principles, enabling more robust algorithms and formal verification methods. It shifts how we approach problem-solving and system design in computer science. #TheoreticalCS #FutureTech
September 9, 2025 at 9:57 AM
A new study shows Kikuchi‑hierarchy spectral algorithms meet the optimal λ ≥ Θ_r(1) n^{-r/4} ℓ^{1/2‑r/4} bound for Tensor PCA, eliminating the √log n factor. Read more: https://getnews.me/sharp-trade-off-for-tensor-pca-via-kikuchi-matrix-bounds/ #tensorpca #kikuchihierarchy #theoreticalcs
October 6, 2025 at 9:56 AM
This proof shows a dramatic theoretical compression in memory needed for computation. From t/log(t) bits down to roughly sqrt(t). Groundbreaking for theoretical computer science. #TheoreticalCS 2/5
July 1, 2025 at 4:00 AM