mattmoses / MechanicalComputingSystemsLinks
mechanical computing with links and rotary joints
☆18Updated 7 years ago
Alternatives and similar repositories for MechanicalComputingSystems
Users that are interested in MechanicalComputingSystems are comparing it to the libraries listed below
Sorting:
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- Synthesis-Aided Compiler for GreenArrays GA144☆54Updated 9 years ago
- Book lucid interpreter written in python☆24Updated 6 years ago
- A revival of the TREE-META compiler-compiler.☆15Updated 7 years ago
- Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.☆19Updated 2 years ago
- Douglas Lenat's AM (Automated Mathematician) from SAIL archives circa 1977☆55Updated 2 years ago
- A Forth implementation for the R216K8B Powder Toy computer.☆27Updated last year
- L. L. Odette's Prolog Virtual Machine (PVM) implemented in Forth. Upgraded to 32 Bit ANSI Forth. Tested on ForthWin.☆17Updated 4 years ago
- Here we give programs that check if Turing machines halt or not.☆15Updated 5 months ago
- a quick system I hacked together to bundle a few thousand pages of notes I mostly haven’t published before up into an archive of pregener…☆15Updated 4 years ago
- Doug Lenat's EURISKO from SAIL archives circa 1981☆68Updated last year
- An archive of material related to the Cyc project.☆33Updated 2 months ago
- Algorithmic Information Theory, using Binary Lambda Calculus☆197Updated 2 weeks ago
- Simple array language written in kotlin☆46Updated 2 years ago
- For exploring http://www.ioccc.org/2012/tromp/hint.html☆35Updated 8 years ago
- An updated version of Sun Microsystems' Fortress programming language that runs in Java 9+.☆15Updated 3 years ago
- A set of files that can be used to create a working version of an early version of the CLU programming language☆37Updated 3 years ago
- ☆61Updated last year
- ☆59Updated 9 years ago
- Compiler, loader, and simulator for the GA144 multi-computer chip☆34Updated 6 years ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆42Updated 8 months ago
- Stackless Joy☆23Updated 9 months ago
- metamath proof enumerators and other things☆92Updated 2 months ago
- An automated approach to the Collatz conjecture☆12Updated 2 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆57Updated 9 years ago
- ☆28Updated 5 months ago
- A Lisp interpreter that displays the contents of the Lisp workspace on an OLED display☆16Updated 6 years ago
- ☆23Updated 3 months ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- CNN in APL☆23Updated 3 years ago