Alternatives and similar repositories for rewriting-collatz

Users that are interested in rewriting-collatz are comparing it to the libraries listed below

• Anon52MI4 / oeis-alien
  ☆20Updated 2 years ago
• david-a-wheeler / mmverify.py
  Metamath verifier in Python
  ☆40Updated 5 months ago
• ptarau / pypro
  Lightweight Prolog-like Interpreter and nested tuple store for unification-based tuple mining in Python
  ☆21Updated 2 years ago
• JUrban / deepmath
  deep learning for math
  ☆28Updated 6 years ago
• desi-ivanov / agda-regexp-automata
  Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
  ☆18Updated 5 years ago
• metamath / metamath-book
  Source of metamath book
  ☆51Updated last year
• firetto / Walnut
  ☆11Updated last year
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆77Updated 5 months ago
• maths / PRESS
  PRolog Equation Solving System
  ☆29Updated 9 years ago
• petablox / difflog
  Difflog: Synthesizing Datalog Programs using Numerical Relaxation
  ☆12Updated 6 years ago
• digama0 / mmj2
  mmj2 GUI Proof Assistant for the Metamath project
  ☆75Updated last year
• ImperialCollegeLondon / xena-UROP-2018
  A place to put our 2018 Xena project UROP thoughts and programs.
  ☆25Updated 5 years ago
• sdiehl / pyrewrite
  Python term rewriting
  ☆30Updated 12 years ago
• bbchallenge / bbchallenge-deciders
  Here we give programs that check if Turing machines halt or not.
  ☆14Updated 2 months ago
• sligocki / busy-beaver
  Tools for finding Busy Beaver Turing Machines and Proving others as non-halting
  ☆46Updated 3 weeks ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆18Updated 3 years ago
• b-mehta / exponential-ramsey
  A formal proof of an exponentially better upper bound on Ramsey numbers
  ☆18Updated 2 years ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• tromp / AIT
  Algorithmic Information Theory, using Binary Lambda Calculus
  ☆174Updated this week
• liuyj8526 / Computation-of-Elliptic-Units
  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
• webyrd / slpKanren
  Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren
  ☆34Updated 12 years ago
• sampsyo / minisynth
  program synthesis is possible
  ☆40Updated 6 years ago
• sorear / metamath-turing-machines
  metamath proof enumerators and other things
  ☆91Updated this week
• metamath / metamath-knife
  Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.
  ☆36Updated 6 months ago
• akkartik / am-utexas
  Reimplementation of Doug Lenat's Automated Mathematician by Bruce Porter's group at the University of Texas at Austin
  ☆58Updated 16 years ago
• argolab / dyna-R
  Dyna built on R-exprs (First Prototype)
  ☆17Updated 3 years ago
• darius / sketchbook
  Smallish programs written to learn something.
  ☆50Updated last year
• BartJongejan / Bracmat
  Programming language for symbolic computation with unusual combination of pattern matching features: Tree patterns, associative patterns…
  ☆48Updated last month
• ashton314 / muKanren_reading
  [Mirror] A close reading of the μKanren paper.
  ☆43Updated 3 years ago
• friguzzi / bddem
  bddem is a SWI-Prolog pack for using Binary Decision Diagrams
  ☆11Updated 2 months ago