lnq ๐Ÿ‘จ๐Ÿฟ‍๐Ÿฆฑ: motif
๐Ÿ‘จ๐Ÿฟ‍๐Ÿฆฑ
Showing posts with label motif. Show all posts
Showing posts with label motif. Show all posts

/ random coil

Ludologically, the function of opening๐Ÿ”“ a loopstring➿ is processed seemingly random (random := state=yes ++ address=no).
/// As in each outcome has equal probability.

A random coil :== the lowest-level [dim≤1] (unmapped) orientation of a brane. This unstructured position sample [an algebraic curve] is known* as its preimage (or illustrative state for both pitch and incidental tax determinance).** I label it 'scribble'.

Instead of being a specific shape/pose, it is a statistical distribution of all populated conformations (albeit, strictly those lacking subunit definition). If each conformation (walk) has equal probability or weight, then such coil is the acoustically-approximated bounds of some twistorspace. (compare denaturation, contrast identity, thread)
/// +It is not uncommon to have multiple different coil(s) for the same opus/string.
+The orientation is that of algebraic curvature because topologically, random coils are random walks on curved surfaces. My given axiom is that encryption can be hidden in its algebra.

Function map: scribblesponge

/ fibor bundle

A fibor bundle (a function of taxation and/or renormalization) :== two (2) or more fibors combined/connected, which itself forms another fibor. This is Egglepple's quaternary isoform. (see ๐Ÿ’ฑswap, bubblegum, hyperlink, minor scale, major scale, coverage, foam)

Function map: minor scalemajor scalefiborfibor bundle

/ walk

lnq's walk A walk :== some playable* spacetime complex folding algorithm (sequence of finite steps at fixed lengths).** Ludologically, some progression and its contrapuntal motion.

This is a plot/flow (ie. curvature) of a nut's path (a type of circuit as it would traverse the braneworld, indicative of current) with stochastic activity at specified movements (openingmiddlegameendgame). In all probability, walks chart a statistical distribution of their entropy (random variables transforming twistorspace).
/// Walks (as circuits) nessarily end in a charge (Q).
In proof theory, there are three (3) stages to a walk: (1) coil, (2) graphics, and (3) mesh.

We use walks as parse arguments in juking [stew choreography]. (see ๐Ÿง‘๐Ÿฟlnq's walk, thread, sport, Pink Poem, route, tip, UUelcome)
/// In automation, walks are approximate source directives.
Function map: preimagewalkimage