Comparing Pure Algorithm to "Informal Algorithm"

"Informal algorithm" is designed to permit the integration of choice and will within its structure...it is thus significantly malleable in the manner within which it will ultimately become manifest.

Words and language (both spoken and written) are a primary resource in the rendering of "informal algorithm"...however, images and actions may also be employed effectively in its conveyance.

The key trait of "informal algorithm" is that it may be gathered up for self-directed integration by the recipient, even though it may embody its own conditions for that integration.

The languages employed in the conveyance of "informal algorithm" are rich with descriptive and idiomatic facilities...it is always specific to the domain of its intended application.

In contrast, pure algorithm offers no degrees of freedom which would permit interpretation or selective resonance...it is purely functional and, over time, must be integrated in its entirety.

Pure algorithm is not gathered up by a recipient (in many cases, such recipient may possess no "gathering" ability whatsoever - as would be the case with latent raw materials)...rather, it is infused, through an absolute resonance, into the recipient (this manner of infusion must be embodied within the algorithm for such action to be manifest).

There are no "nouns" in the language of pure algorithm, enabling it to remain wholly domain-independent...the whole of the formal language targets structure and a defined reciprocal relationship between function and time.

Much of the "purity" of formal algorithm may be attributed to its domain-independence, as only the function is defined - not the application...as such, a given pure algorithm is free to exercise its defined functioning within any application or domain.

There exist no real "constants" within pure algorithm, even though the algorithm itself may make such constants manifest within its course of function...these are regarded as a byproduct rather than a source of a pure algorithm.

Constants, however, may be effectively utilized within the course of the "discovery" of a given algorithm, as these can lead to a quantification of the behaviours upon which the algorithm in conceived.

Conversely, constants are a staple within "informal algorithm", as these may be used to establish a level of quantification which would otherwise be absent from its structure.

Pure algorithm is rich with "variables" which act as place-holders and addresses for whatever components the algorithm is acting upon in a given domain of function...these remain in continuous flux and re-flux throughout the course of the working of the algorithm.

In contrast, "informal algorithm" is commonly averse to the inclusion of variables within its structure due to their continuous flux and re-flux, as these may be perceived as "undermining the integrity" of that which is conveyed...instead, the drive is toward stable identifiers and values.

Variables, however, may be effectively used within the scope of the conception of "informal algorithm", to be replaced by constant values during its preparation for conveyance.

It is the variables that are chiefly responsible for domain-independence within pure algorithm (some given variable, for example, could contain a collection of herbs, a weather pattern, a human manifold, or even another algorithm - depending upon the domain in which it is currently functional).

"Informal algorithm" thrives within the presence of understanding and reasonability...the greater the capacities of a recipient in these regards, the greater the efficiency of integration.

Pure algorithm is not contingent upon reason, nor is it able to be wholly identified using the faculties of reason...its function will thus encompass no distinction between various capacities of reasoning, and is functional equally in the absence of reason.

It is often necessary to construct supplemental structures within the scope of a given "informal algorithm" designed to address the various degrees of reasonability within a target population...the goal of this is to promote a common foundation of understanding among diverse capacities within a target population (for example, establishing a shared base of idioms and language may be effective toward achieving this goal).

Assignment within pure algorithm is employed to ephemerally integrate a manifest domain condition into the active structure of the algorithm, thus facilitating the action of transformation upon that condition...assignments of this type are wholly discarded in the natural course of flux and re-flux.

Assignment within "informal algorithm" has no natural place, as the domain-dependence present in its working encourage the permanent persistence of such assignments...thus, this manner of assignment encourages stasis and inhibits freedom of growth and transformation.

In pure algorithm, the automatous structures made manifest through its rendering are the agents of transformation... if the algorithm is designed with the inclusion of propagation, these agents are also self-replicating.

In "informal algorithm", the recipients of its conveyance become the active agents of transformation through their refinement of condition and action ...the propagation of the algorithm would thus be carried out through its subsequent conveyance of its essence by these recipient agents (it is not a self-replicating structure, as its propagation is a conditional function that is based upon the will of the recipient).