-
Notifications
You must be signed in to change notification settings - Fork 0
Home
The concept of statistics and blackboxes has existed in the field of artificial intelligence for decades but what of languages and knowing what word can be used to generate the next series of words? Everyone guesses what words can come out of someone talking given enough experience. In this article, the idea of inferrable languages is presented which are languages that allow the next series of words in the sequence to be inferred given enough samples in the sequence.
The article, Inferring Lindenmayer Systems, is about deterministically producing the next series of words given a complete sequence of words.
Let's apply this idea with the monomial decider and picking function from the following article, Applications for Monomial Deciders.
Applying The Fibonacci Decider
Fibonacci D0L Decider Left Hand Side
Fibonacci D0L Decider Right Hand Side
The Law of Commutativity and Noncommutativity
Condensed Law of Commutativity and Noncommutativity