D. Edward Mitchell 16:00, 14 April 2020 (UTC) Hello World!    groupKOS Developer Share —usually UNDER CONSTRUCTION

Quasi Axiomatic Theory Noise Analysis Project

From groupKOS Developer Share
Jump to navigation Jump to search

edit template

QATNAP    Home   °  
Quasi Axiomatic Theory Noise Analysis Project edit

As a private character passing for human, a fascination plays my intent matrix:

Focus: What random motions may mean, should their behavior be deciphered.

Intent: Apply computer science principles to noisy timing signals to model the variation of delays among a matrix of sensors.

Preclussions Thought dAxiom / dτ = Experimental Conjecture


Magnetic harmony frog-ear technology

In nature, being over-energized and primed to react at the slightest asymmetry is the mechanism of a frog's ear, with a chemical oscillator energizing a sonic sensor micro-hair that over-responds from a bifurcation point to the vibration of a fly's wing over the din of wind through the cattails.

The magnetic power envelop is over-primed and floating. The slightest perturbation in the ambient magnetic field is the beginning of a trill in Earth's Van Allen belt.

The power envelop's average timing center driven to a bifurcation point coheres into the trill and the energy envelop of the 3D resonance is resonant at measure-able amplitudes with the Van Allen melody whispering in the magnetosphere. Frog slurps fly.

Follow the bumpy adventure of how this thought scenario renders to transistors and copper. Your mind is drawn to...

The Button

A category of a datum is the value of that datum exactly, algorithmically.

Making spook glasses

DIY — esoteric comp sci applied to multi-element harmonic structure to data categorize every variation in timing at every node at every 1/2 microsecond.

A simple and common data structure is called a binary tree. The binary-tree data-structure is a block of memory that is marked-up with extra information. The extra info is links pointing to other values in the memory block that are comparatively different in two ways (binary) compare lesser, or compare greater.

The binary tree literally categorizes the individual datum into unique slots, or categories. Zip files do this, with enough extra markup in know how to unzip the binary tree back to the original file.

Codasaurus Hex, the younger, nor the present I, the dumber, know how to apply the QAT paradigm for engineered solutions to any complete degree.

But a gestalt for the paradigm may allow the --uhmm-- the transmogriphication of the hands-on skill of QAT programming to a design of a QAT solution that is mostly hardware. That solution would be a hard-circuit data-category-engine for multiple categorical comparisons on live data, where the category-base is the history of the data stream.

The timing-error-accumulation inherent in a ring-oscillator provides randomness, where the QAT algorithms use computer generated random numbers.

The QAT scatter-gather process that segregated data categories by occurrence-frequency working with fractal-similarity to the unknown dynamic has a physical analog.

The experimental physical analog of the QAT algorithmic scatter-gather algorithm is coherence —like when pulses among the random timing are selected and absorbed by the harmonic wave front, and the wave remains the same wave curvature, only strengthened in amplitude evenly.