📐 Lean 4 - ColonelPhantom · Scour

TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.

🧩SAT Solvers Code

github.com··Hacker News

Less-relevant results

Formal Foundations and Proof-Carrying Certificates for q-ary Covering Codes in Lean 4

🧩SAT Solvers Academic

Proof System Timelines

λPLT Blog

Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT

🧩SAT Solvers

eprint.iacr.org·

Programming Languages Software Award

⚙️Compilers

FOD#155: Continual Learning in LLMs: Why AI Models Need Sleep

🗣️Programming Languages

turingpost.com·

You don't need Copilot for code completion, try this instead

⚙️Compilers

mistral.ai··r/GithubCopilot

meleantonio forked meleantonio/autoform-bot from facebookresearch/autoform-bot

⚙Programming Language Design Code

Evaluation of LLMs for Mathematical Formalization in Lean

⚙️Compiler Design Academic

A Proof in Coq that Core Logic is not Paraconsistent

λPLT Academic

meleantonio starred facebookresearch/autoform-bot

⚙Programming Language Design Code

Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

⚙Programming Language Design Academic

Formal verification of the S-two AIR

🗣️Programming Languages Academic

Imbuing Large Language Models with Bidirectional Logic for Robust Chain Repair

🧩SAT Solvers Academic

Log in to enable infinite scrolling