You should at least read the Omnilow Rules section in the Omnilow Algorithmic Language Main Description post before reading this post.
This post has an Omnilow algorithm to better understand the Omnilow algorithmic language and algorithmic language in general. Both the Omnilow algorithms and the natural language (English) in that parent algorithm are important to read. This post is not needed for being able to effectively use the Omnilow algorithmic language, but it is helpful and very recommended to read and understand. That parent Omnilow algorithm algorithmically defines what an algorithm, algorithmic object, algorithmic operator, and algorithmic variable are, and I at least don't know of anyone else that has ever done that before.
(Note: The Omnilow in this post contains some minor Omnilow guideline errors, but no Omnilow rule violations. Omnilow AI Ventures has a fully corrected version; this older public version has not yet been updated to incorporate those minor corrections. If you would like the corrected version or would particularly benefit from this public post being updated, please contact me.)
I would suggest reading that algorithm as the file below with Notepad++. A big reason I suggest Notepad++ is because Notepad++ can effectively highlight/indicate parentheticals. That functionality is extremely helpful for reading these Omnilow algorithms. I would recommend having "Word wrap" turned on in Notepad++.
If you would prefer to copy that algorithm and paste it into Notepad++ or another app instead of downloading it, you can do so below. I would recommend only downloading the file above and not referring to the below copy.
Copy Of That .txt File’s Contents
(
(
{This file is a part of my post at "SS5.org/2025/01/14/Meta-Omnilow-Algorithm".}
((Algorithmic Object)(is)(((Part)(of)(Algorithm))(that is)(((not)((potentially)((does)(External Action))))(and)(Algorithmic))))
((Algorithmic Operator)=((((any)(specific))(algorithmic operator))(transformed into an algorithmic object that represents that algorithmic action)))
((Algorithmic Operator)(is)(((Part)(of)(Algorithm))(that is)((Algorithmic)(and)((potentially)((does)(External Action))))))
{I use the "(transformed into an algorithmic object that represents that algorithmic action)" algorithmic operator to transform the algorithmic operator (to the left of it) into an algorithmic object (but otherwise have it be unchanged). In other words, I use it to indicate that algorithmic operator won't be applying an external action in the algorithm it is in. I do that to reduce confusion.}
((Algorithmic Variable)=(((((some)(specific))(((Number)(that is)((Summand)(of)1))(of)(Algorithmic Object)))((and)(or)(or))(((some)(specific))(((Number)(that is)((Summand)(of)1))(of)(Algorithmic Operator))))(that is)(((in)(((some)(specific))(Numbered Order)))(and)(=(((some)(specific))(Variable)))(and)(Algorithmic))))
((Algorithmic Variable)((acts as)(and)(is))(((Algorithmic Object)(and)((not)(Algorithmic Operator)))(or)((Algorithmic Operator)(and)((not)(Algorithmic Object)))))
((Algorithm)=(((((some)(specific))(((Number)(that is)((Summand)(of)1))(of)(Algorithmic Object)))((and)(or)(or))(((some)(specific))(((Number)(that is)((Summand)(of)1))(of)(Algorithmic Operator)))((and)(or)(or))(((some)(specific))(((Number)(that is)((Summand)(of)1))(of)(Algorithmic Variable))))(that is)(((in)(((some)(specific))(Numbered Order)))(Algorithmic))))
{All the algorithms in this parent-most parenthetical discuss what algorithms, algorithm objects, operators, and variables are. An algorithmic object is something that could never cause an external action in any possible algorithm it would be in, and an algorithmic operator is something that could potentially cause an external action. An algorithmic variable is an ordered arrangement of algorithmic object(s) and/or algorithmic operator(s) that is equated to a specific term.}
)
(
((Quantity)=(((some)(specific))((Algorithmic Variable)(that is)((Algorithmic Object)(that is)((Fundamental)(in)(Algorithm))))))
(42=(((some)(specific))((Algorithmic Object)((not)((that is)((Fundamental)(in)(Algorithm)))))))
{Quantities are fundamental algorithmic objects. Any single number is not a fundamental algorithmic object.}
((Location)=(((some)(specific))((Algorithmic Variable)(that is)((Algorithmic Object)(that is)((Fundamental)(in)(Algorithm))))))
{Entities' locations (such as the order of algorithmic objects/operators in an algorithm) is a fundamental algorithmic concept.}
((The "=" Algorithmic Operator)=(=(transformed into an algorithmic object that represents that algorithmic action)))
((The "=" Algorithmic Operator)(is)(((some)(specific))((Algorithmic Operator)(that is)((Fundamental)(in)(Algorithm)))))
((The Parenthesis Algorithmic Operator)=((((transformed into an algorithmic object that represents that algorithmic action))(or)()(transformed into an algorithmic object that represents that algorithmic action))))
{The above algorithm has the "(" algorithmic operator and then the ")" algorithmic operator transformed into an algorithmic object that represents that algorithmic action. In other words, the parenthesis directly before the "(transformed into an algorithmic object that represents that algorithmic action)" operator doesn't actually act as a parenthesis for grouping purposes. That makes that algorithm difficult to follow since (if you're using software that highlights/indicates parentheticals) the wrong pair of parentheses will be highlighted/indicated between when that "(" and that ")" appear in that writing.}
((The Parenthesis Algorithmic Operator)(is)(((some)(specific))((Algorithmic Operator)(that is)((Fundamental)(in)(Algorithm)))))
((The "*" Algorithmic Operator)=(*(transformed into an algorithmic object that represents that algorithmic action)))
((The "*" Algorithmic Operator)(is)(((some)(specific))((Algorithmic Operator)((not)((that is)((Fundamental)(in)(Algorithm)))))))
((The "(in)" Algorithmic Operator)=((in)(transformed into an algorithmic object that represents that algorithmic action)))
((The "(in)" Algorithmic Operator)(is)(((some)(specific))((Algorithmic Operator)((not)((that is)((Fundamental)(in)(Algorithm)))))))
{A quantity and a location are examples of fundamental algorithmic objects. A quantity is fundamental because an algorithm couldn't use a specific quantity of any algorithmic object or algorithmic operator without numbers. A location is fundamental because an algorithm couldn't use a specific ordering of any algorithmic objects or algorithmic operators without a kind of location for these algorithmic objects or algorithmic operators in this algorithm.
Algorithmic parts being equaled to each other is an example of a fundamental algorithmic operation. This is fundamental because an algorithm couldn't in-any-way define an algorithmic part without at least partial equality.
Algorithmic parts being grouped together is an example of a fundamental algorithmic operation. This is fundamental because an algorithm couldn't in-any-way have more than one algorithmic parts without grouping those algorithmic parts apart from that algorithm. Multiplying numbers together and something being in something else are examples of non-fundamental algorithmic operations.}
)
(
((First Specific Possibility)=((((some)(specific))(((Number)(that is)((Summand)(of)1))(of)((Algorithmic Object)(that is)((Fundamental)(in)(Algorithm)))))(((some)(specific))(((Number)(((that is)((Summand)(of)1)))(or)(=0))(of)((Algorithmic Operator)(that is)((Fundamental)(in)(Algorithm)))))))
((Second Specific Possibility)=(((some)(specific))(((Number)(that is)(((Summand)(of)1)(>1)))(of)((Algorithmic Operator)(that is)((Fundamental)(in)(Algorithm))))))
((Algorithmic Object)=(((First Specific Possibility)(or)(Second Specific Possibility))(that is)(((in)(((some)(specific))(Numbered Order)))(and)(Algorithmic))))
((Algorithmic Operator)=(((((some)(specific))(((Number)(that is)((Summand)(of)1))(of)((Algorithmic Operator)(that is)((Fundamental)(in)(Algorithm)))))(((some)(specific))(((Number)(((that is)((Summand)(of)1)))(or)(=0))(of)((Algorithmic Object)(that is)((Fundamental)(in)(Algorithm))))))(that is)(((in)(((some)(specific))(Numbered Order)))(and)(Algorithmic))))
{Fundamental algorithmic language is (and only is) fundamental algorithmic object(s) (like numbers) and/or fundamental algorithmic operator(s). Algorithmic language is (and only is) fundamental algorithmic language, algorithmic object(s) that are equated to fundamental algorithmic language, algorithmic operator(s) that are equated to fundamental algorithmic language, and/or variable(s) that are equated to fundamental algorithmic language.
It is often very efficient to have an algorithmic object/variable be defined by what it "is" rather than what it "equates to". This is because something "being" something else is a special kind of partial equality, so that first something ("being" that second something) means that either those two things are equal or only partially equal in a qualifying way.
I generally don't equate non-fundamental algorithmic language to fundamental algorithmic language because reading that would be extremely time consuming (and not close to worth it). It would be like trying to learn a language by only reading plain text in that language; doing so would be overly complicated/impossible because it would be overly meta. An algorithm that has each non-fundamental algorithmic variable, object, or operator in another complex algorithm "equate to" fundamental algorithmic language would be very extremely long.}
{For a full and completed written work of complex algorithms, the algorithms in that composition should be complete, but those algorithms should almost certainly not be fully detailed. It being fully detailed would require every non-fundamental algorithmic object and operator to be fully equated to fundamental algorithmic language (in that writing).
However, those non-fundamental things would of course be fully equated to fundamental algorithmic language outside of the writing. If the algorithms in that written work is adequately written, that written work should become fully detailed if those equations were added in (which is a good way to determine if a written work is complete or not).
If those equations were added in, the amount of writing in that written work would probably be many times longer and be extremely excessive. Although, if that was the case, a human-made computer could fully understand and simulate all of the algorithms in that composition (if there was an adequate compiler for doing that).}
)
(
{All the algorithms in this parent-most parenthetical demonstrate how algorithm objects/operators being next to each other might represent the "(and)" operator.}
((Algorithmic Object #1)=(((any)(specific))(Algorithmic Object)))
((Algorithmic Object #2)=(((any)(specific))(Algorithmic Object)))
(((Algorithmic Object #1)(Algorithmic Object #2))=((Algorithmic Object #1)(and)(Algorithmic Object #2)))
(((Algorithmic Object #2)(Algorithmic Object #1))=((Algorithmic Object #2)(and)(Algorithmic Object #1)))
((Algorithmic Operator #1)=((Algorithmic Operator)(in which)((((Algorithmic Operator #1)((not)((cause)((External Action)(to)(Algorithmic Object #1)))))(in)(((Algorithmic Object #1)(Algorithmic Operator #1))(or)((Algorithmic Operator #1)(Algorithmic Object #1))))(((Algorithmic Operator #1)((not)((cause)((External Action)(to)(Algorithmic Operator #2)))))(in)(((Algorithmic Operator #2)(Algorithmic Operator #1))(or)((Algorithmic Operator #1)(Algorithmic Operator #2)))))))
((Algorithmic Operator #2)=((Algorithmic Operator)(in which)(((Algorithmic Operator #2)((not)((cause)((External Action)(to)(Algorithmic Operator #1)))))(in)(((Algorithmic Operator #2)(Algorithmic Operator #1))(or)((Algorithmic Operator #1)(Algorithmic Operator #2))))))
(((Algorithmic Object #1)(Algorithmic Operator #1))=((Algorithmic Object #1)(and)(Algorithmic Operator #1)))
(((Algorithmic Operator #1)(Algorithmic Object #1))=((Algorithmic Operator #1)(and)(Algorithmic Object #1)))
(((Algorithmic Operator #1)(Algorithmic Operator #2))=((Algorithmic Operator #1)(and)(Algorithmic Operator #2)))
(((Algorithmic Operator #2)(Algorithmic Operator #1))=((Algorithmic Operator #2)(and)(Algorithmic Operator #1)))
)
{I, Samuel Sauer, created and wrote this file and all the significant concepts in this file. Everything in this file is encoded in UTF-8.}
)
I, Samuel Sauer, created and wrote this post and all the significant concepts in this post.
Share:
Copy This Post’s URL:
SS5.org/2025/01/14/Meta-Omnilow-Algorithm
Leave a comment.