MarkovJunior
Probabilistic language based on pattern matching and constraint propagation, 153 examples
About this project
MarkovJunior MarkovJunior is a probabilistic programming language where programs are combinations of rewrite rules and inference is performed via constraint propagation. MarkovJunior is named after mathematician Andrey Andreyevich Markov, who defined and studied what is now called Markov algorithms. In its basic form, a MarkovJunior program is an ordered list of rewrite rules. For example, MazeBacktracker (animation on the left below) is a list of 2 rewrite rules: 1. RBB=GGR or "replace red-black-black with green-green-red". 2. RGG=WWR or "replace red-green-green with white-white-red". On each execution step MJ interpreter finds the first rule in the list that has a match on the…
Technologies
Project health
GitHub
Reviews
Built by
Maintain mxgmn/MarkovJunior? Claiming verifies admin access through your GitHub account and gives you control of this listing.
