emreyolcu / rewriting-collatzLinks
An automated approach to the Collatz conjecture
☆12Updated 2 years ago
Alternatives and similar repositories for rewriting-collatz
Users that are interested in rewriting-collatz are comparing it to the libraries listed below
Sorting:
- Metamath verifier in Python☆40Updated 6 months ago
- Lightweight Prolog-like Interpreter and nested tuple store for unification-based tuple mining in Python☆21Updated 2 years ago
- ☆22Updated 2 years ago
- Javascript implementation of Fractran☆14Updated 8 years ago
- Difflog: Synthesizing Datalog Programs using Numerical Relaxation☆12Updated 6 years ago
- Here we give programs that check if Turing machines halt or not.☆14Updated 3 months ago
- Programming language for symbolic computation with unusual combination of pattern matching features: Tree patterns, associative patterns…☆48Updated 3 weeks ago
- PRolog Equation Solving System☆29Updated 9 years ago
- Python term rewriting☆30Updated 12 years ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- Source of metamath book☆51Updated last year
- Tools for finding Busy Beaver Turing Machines and Proving others as non-halting☆46Updated last month
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- Reimplementation of Doug Lenat's Automated Mathematician by Bruce Porter's group at the University of Texas at Austin☆58Updated 16 years ago
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Updated 8 years ago
- Cellular automata search program☆26Updated 3 years ago
- Prove formulas of Presburger Arithmetic☆11Updated last year
- Explainable machine learning☆17Updated 6 years ago
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 5 years ago
- ☆11Updated last year
- LODA is an assembly language, a computational model and a tool for mining integer sequence programs.☆21Updated 4 years ago
- Neural Guided Constraint Logic Programming for Program Synthesis☆93Updated 6 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated last month
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- deep learning for math☆29Updated 6 years ago
- program synthesis is possible☆40Updated 6 years ago
- Smallish programs written to learn something.☆50Updated last year
- Book lucid interpreter written in python☆24Updated 6 years ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆39Updated 2 years ago