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
- ☆22Updated 2 years ago
- Lightweight Prolog-like Interpreter and nested tuple store for unification-based tuple mining in Python☆21Updated 2 years ago
- Cellular automata search program☆26Updated 3 years ago
- Programming language for symbolic computation with unusual combination of pattern matching features: Tree patterns, associative patterns…☆49Updated 2 weeks ago
- Here we give programs that check if Turing machines halt or not.☆15Updated 3 months ago
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- Source of metamath book☆51Updated 2 years ago
- Proof assistant for opetope and opetopic set derivation systems☆15Updated 5 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated last year
- An implementation of the APL language in Python with the Numpy module☆29Updated 9 years ago
- Reimplementation of Doug Lenat's Automated Mathematician by Bruce Porter's group at the University of Texas at Austin☆58Updated 17 years ago
- PRolog Equation Solving System☆29Updated 9 years ago
- Python term rewriting☆30Updated 12 years ago
- Smallish programs written to learn something.☆50Updated last year
- Book lucid interpreter written in python☆24Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Javascript implementation of Fractran☆14Updated 8 years ago
- LODA is an assembly language, a computational model and a tool for mining integer sequence programs.☆21Updated 4 years ago
- deep learning for math☆29Updated 6 years ago
- Java-based lightweight Prolog virtual machine☆35Updated last year
- Difflog: Synthesizing Datalog Programs using Numerical Relaxation☆12Updated 6 years ago
- Tools for finding Busy Beaver Turing Machines and Proving others as non-halting☆47Updated 2 months ago
- We compute the Brumer-Stark units and the polynomial required to generate the Hilbert class field of some real quadratic fields, as compu…☆31Updated 4 years ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- Lightweight Prolog-like system designed to smoothly interoperate with deep learning tools☆33Updated 2 months ago
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 5 years ago
- LODA Programs for Integer Sequences☆37Updated this week
- Dyalog APL ←→ Python interface☆82Updated 2 months ago