bbchallenge / bbchallenge-decidersLinks
Here we give programs that check if Turing machines halt or not.
☆13Updated 3 months ago
Alternatives and similar repositories for bbchallenge-deciders
Users that are interested in bbchallenge-deciders are comparing it to the libraries listed below
Sorting:
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆33Updated last month
- Mathematical proofs of the bbchallenge project.☆24Updated last month
- Busy Beaver deciders backed by Coq proof☆53Updated 3 months ago
- Matroids in Lean☆18Updated last year
- Metamath verifier in Python☆39Updated 3 weeks ago
- Solutions to math olympiad problems in Isabelle/HOL☆11Updated 4 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 4 years ago
- ☆19Updated 2 years ago
- A place to put our 2018 Xena project UROP thoughts and programs.☆25Updated 5 years ago
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆20Updated 3 years ago
- Formalizing results about the Mandelbrot set in Lean☆21Updated 7 months ago
- metamath proof enumerators and other things☆94Updated 11 months ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆72Updated last week
- The Candle theorem prover (fork of the HOL Light sources)☆14Updated 9 months ago
- Exploration of primes, factorization and number theory through haskell☆10Updated 8 years ago
- Plain-text declaration export for Lean 4☆17Updated 3 weeks ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆50Updated 8 months ago
- sorear's Metamath system engine - version 3 Rust☆24Updated 2 years ago
- Very controlled natural language tactics for Lean☆64Updated last year
- Tableau for basic modal logic in Lean 3 - This is OLD and not maintained. See https://github.com/m4lvin/lean4-pdl instead.☆13Updated last year
- ☆23Updated 3 years ago
- Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.☆18Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated 10 months ago
- Javascript implementation of Fractran☆14Updated 7 years ago
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆13Updated last year
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- ☆11Updated last year
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago