✳flâneur — a map of the web's best reading

Eric Parfitt's Projects

esopsis.github.io · 251 words · saved by 1 readers

Visualizing Game Trees in the "Trax" Board Game Graph Rewriting as a Base for Machine Learning Nondeterministic Constraint Logic Game Enumerating Interaction Nets, a Graph Rewrite Based Programming Language Exploring 1D Repeating Logic Gate Arrays A Simple Turing Complete Rube-Goldberg System (Based on Cyclic Tag) 4 Dimensional Battle Tank Game Endless Colored Rule 110 Cellular Automaton Based Screensaver "Conservation Laws" in the Rule 37R Reversible Cellular Automaton Self-Avoiding Hexagonal Branching "Base Infinity" Number System Exploding Bubbles "Game" Simple Made-Up Word Genrator All the Ways Size <5 (or <N) SK Combinators can Evaluate Compiling a Turing Machine to an extremely simple system, Cyclic Tag Emulating a Functional Language in an Imperitave One Visualizing a language where each integer is a valid program, Jot Enumerating Balanced Binary Trees Decompiling Combinators into Lambda Calculus Implementing the State Monad and Do Notation in the Wolfram Language Proof that the

Eric Parfitt's Projects Coding Projects Visualizing Game Trees in the "Trax" Board Game Graph Rewriting as a Base for Machine Learning Nondeterministic Constraint Logic Game Enumerating Interaction Nets, a Graph Rewrite Based Programming Language Exploring 1D Repeating Logic Gate Arrays A Simple Turing Complete Rube-Goldberg System (Based on Cyclic Tag) 4 Dimensional Battle Tank Game Endless Colored Rule 110 Cellular Automaton Based Screensaver "Conservation Laws" in the Rule 37R Reversible Cellular Automaton Self-Avoiding Hexagonal Branching "Base Infinity" Number System Exploding Bubbles "Ga

Explore this link on the map →

related reading