💻 CS Theory - ch1n3du · Scour

On the Complexity of Signed Domination

λType Theory Academic

Are Neural Networks Collision Resistant?

🔍Interpretability

The Future Is Undecidable. Duty Is Not.

🔍Interpretability Blog

dhanjit.me··Hacker News

Samuel Mimram — CSC_51051_EP -- Computational logic: from Artificial intelligence to Zero bugs

lix.polytechnique.fr·

A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP

zenodo.org··Hacker News

Co-Creator of Haskell: Functional Programming, Thinking in Types, Useless Languages | Simon Jones

⚙️Compilers News

developing.dev·

Show HN: TuringLLM – a LLM-powered Universal Turing machine

⚙️Compilers Code

github.com··Hacker News

Proof System Timelines

⊢Logic Blog

Programming Languages Course Reboot, 2026

📐Formal Methods Reference

docs.google.com··Lobsters

Turing universal neural networks do not require global clocks

🔍Interpretability Academic

nature.com··Hacker News

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

🔍Interpretability Academic

Wikipedia:Vital articles/Level 5/Technology/Computing and communication

📡Information Theory

en.wikipedia.org·

A Mike's-Eye View of ARC's Research

🔍Interpretability

lesswrong.com·

Why Compiler Engineers Rarely Use Strassen's Algorithm for Fast Matrix Multiplications

⚙️Compilers News Blog

leetarxiv.substack.com··Substack, r/programming

On Architecture Research

🏺Ancient History

Single-Story Villa

On the Complexity of the Bi-infinite Post Correspondence Problem

λType Theory Academic

Buffalo commission will draft up major reforms to city charter

🏛️Political Science

investigativepost.org·

Performative prediction

🔍Interpretability

danmackinlay.name·

STITCH: Spatial Transcriptomics Imputation via Flow Matching with Internal Learning

🔍Interpretability Academic

Log in to enable infinite scrolling