km-git-acc / dbn_upper_boundLinks
Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project
☆13Updated 2 years ago
Alternatives and similar repositories for dbn_upper_bound
Users that are interested in dbn_upper_bound are comparing it to the libraries listed below
Sorting:
- Perfectoid spaces in the Lean formal theorem prover.☆125Updated last year
- IMO Grand Challenge for Artificial Intelligence☆46Updated 3 years ago
- A Learning Environment for Theorem Proving☆75Updated 3 years ago
- Interesting ATP Proofs☆13Updated 3 years ago
- The formal proof of the Kepler conjecture☆156Updated last year
- Formalization of Statement of Local Langlands Correspondence for Tori☆11Updated 6 years ago
- Formalization of the existence of sphere eversions☆43Updated 2 weeks ago
- Modification to Coq to record intermediate proof states encountered during a proof☆8Updated 6 years ago
- Python talking to the Lean theorem prover☆45Updated 3 years ago
- 💧 Liquid Tensor Experiment☆203Updated last year
- Exact Inference Engine for Probabilistic Programs☆133Updated 4 months ago
- All the math/tex files for the Automorphic Project☆19Updated last year
- Johan's clone of the cring repository from http://cring.adeel.ru/☆29Updated 11 years ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆64Updated last year
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- ☆19Updated 2 years ago
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆20Updated 3 years ago
- lecture notes for Analytic Geometry course☆11Updated 3 years ago
- An open bibliography of machine learning for formal proof papers☆32Updated last year
- Stalin∇, a brutally optimizing compiler for the VLAD language☆76Updated 7 years ago
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆82Updated 2 weeks ago
- blueprint for prime number theorem and more☆173Updated this week
- ☆15Updated last year
- Holophrasm: a neural Automated Theorem Prover for higher-order logic☆55Updated 5 years ago
- ☆27Updated 3 years ago
- Interactive neural theorem proving in Lean☆123Updated 3 years ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- ☆50Updated 3 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆56Updated 10 years ago
- Formalizing results about the Mandelbrot set in Lean☆21Updated 8 months ago