Kroneckera / bunkbed-counterexample
☆12Updated last month
Related projects ⓘ
Alternatives and complementary repositories for bunkbed-counterexample
- Busy Beaver deciders backed by Coq proof☆39Updated 4 months ago
- Exhaustive list of all foods & food items in the world. Crawled from Wikipedia.☆19Updated 7 years ago
- ☆19Updated last year
- Content of Online Encyclopedia of Integer Sequences (OEIS)☆63Updated this week
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆27Updated 3 weeks ago
- Metamath verifier in Python☆34Updated 7 months ago
- Cellular automata search program☆26Updated 2 years ago
- I ❤︎ FEM: A finite element method demo in Umka and tophat☆16Updated 2 months ago
- A fungeoid language where bends in the chain determine the instructions☆12Updated 3 years ago
- We compute the Brumer-Stark units and the polynomial required to generate the Hilbert class field of some real quadratic fields, as compu…☆32Updated 3 years ago
- LODA Programs for Integer Sequences☆31Updated this week
- A solver for halting problem of Brainfuck programs☆16Updated 4 years ago
- On the roots of beauty☆11Updated last year
- Formalizing results about the Mandelbrot set in Lean☆20Updated 2 weeks ago
- Quipu Programming Language☆18Updated 11 years ago
- Code to download, process, and analyse the Online Encyclopedia of Integer Sequences☆46Updated last year
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆19Updated 3 years ago
- Tag-based webview of LaTeX documents☆28Updated 9 months ago
- 🫓 A parser for the FlatZinc modelling language☆11Updated last month
- Leveraging AlgebraicJulia to provide an interface for scientists to explore spaces of models.☆11Updated last year
- Java implementations of sequences in the OEIS☆58Updated this week
- A formalized proof of Carleson's theorem in Lean☆29Updated this week
- Manim scripts used in Tungsteno https://www.tungsteno.io/☆29Updated 4 years ago
- Set of tools and data to compute all known invariants for simple connected graphs☆13Updated 6 years ago
- ☆12Updated last year
- Runtime and miner for the LODA language written in C++☆22Updated last week
- A formal consistency proof of Quine's set theory New Foundations☆66Updated this week
- Exact reduction of ODE models via linear transformations☆13Updated 9 months ago
- Here we give programs that check if Turing machines halt or not.☆10Updated this week