cslarsen / busy-beaver
Calculates the uncomputable Busy Beaver Σ-function
☆11Updated 8 years ago
Alternatives and similar repositories for busy-beaver:
Users that are interested in busy-beaver are comparing it to the libraries listed below
- Busy Beaver deciders backed by Coq proof☆52Updated 2 months ago
- A simple Brainfuck JIT written as a learning exercise.☆16Updated 5 years ago
- A fungeoid language where bends in the chain determine the instructions☆12Updated 3 years ago
- Proof assistant for opetope and opetopic set derivation systems☆15Updated 5 years ago
- Updated LazyK source distribution☆18Updated 6 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- ☆19Updated 2 years ago
- Cat's Eye Technologies' distribution of John Colagioia's Thue programming language☆26Updated 9 years ago
- Tools for finding Busy Beaver Turing Machines and Proving others as non-halting☆38Updated last week
- metamath proof enumerators and other things☆93Updated 9 months ago
- Quipu Programming Language☆20Updated 12 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated 8 months ago
- lang Thue + Regex☆14Updated 3 years ago
- Cλash/Haskell FPGA-based SKI calculus evaluator☆49Updated 9 years ago
- Orchard Opetopic Proof Assistant☆27Updated 9 years ago
- LODA is an assembly language, a computational model and a tool for mining integer sequence programs.☆21Updated 3 years ago
- Theorem proving in Lean☆49Updated 6 months ago
- a self-hosting lambda calculus compiler☆35Updated last month
- Here we give programs that check if Turing machines halt or not.☆13Updated 2 months ago
- Haskell to brainfuck compiler☆29Updated 10 years ago
- LODA Programs for Integer Sequences☆34Updated this week
- A Python interpreter for the huh? programming language.☆10Updated 7 years ago
- A superset of brainfuck with dynamic memory management.☆28Updated 4 years ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆33Updated this week
- Continued fraction library☆30Updated 4 years ago
- An embedding and formalization of GAP (groups, algorithms, Programming) in LEAN4☆15Updated 2 years ago
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.☆18Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆70Updated last month