Start Liber UUU
Something I'll think about later as. . .
Start
Daily Sixteen Abeghiklmnorstu
Bghklmnrstaeiou
Lanesiaoiu
Aghelairs(o/i)aou
ABehilaiosiau
Ighil(a/o)nosou
IAO gholonosu
OO --- and here we substitute Ain Soph to get
Gahindosophosu
End
Daily SixteenWe can now say that the Kleene algebra
1 on the alphabet Abeghiklmnorstu
Ds (performs
Daily Sixteen) to Gahindosophosu. That is, any sentence composed from the letters A b e g h i j l m n o r s t and u (and including all of these letters) can be reduced by
D to Gahindosophosu.
Here as in Daily Sixteen, automatic
2 rule
3 violations may be kept as final or transient random mutations, and the brain may prompt.
For vowels a and b, a/b denotes a over b just as 93/93 denotes Thelema/Agape. So (o/i) is i under o and (a/o) is o under a.
End Liber UUU
AEA EIO
Longer sentences will be more likely to have
D(A) (with A the whole alphabet). Here of course, this means D(Abcdefghijklmnopqrstuvwxyz).
One example of
D(A):
Initial rules: all vowels to the right, aeiou left shift 12345 respectively, o eats what it lands on, trailing vowel eats, string starts at consonant preceding the leading vowel, string berths without vowels in them contain the letter from that berth in the initial string.
Bcdfgjklmnpqrstvwxyzaeiou
ya
suoiea
4 lunporsevwa
fughjklonpesuva
gojkl(e/u)nprsua
duojenra
Abodeeja
Obeea
EAE
1 http://www.cs.cornell.edu/Courses/cs786/2004sp/Lectures/l02-axioms.pdf2 http://en.wikipedia.org/wiki/Automata_theory3 http://en.wikipedia.org/wiki/Rule_110 Rule 110 is shown only as an example of a rule for cellular automata.
4 Consonant survival or ingestion here is arbitrary. Checking the result of all
5 available options is advisable.
5 All practically available and those as they happen. Remember this is not an algorithm, yet we can still program to evaluate
D of a string by prompting for sets of rule changes.
6 Just saying 'End Liber UUU' doesn't actually end it.
