Algorithms

Algorithms can be used to improve your software (e.g. metacognition).

Bucket sort → explore/exploit tradeoff
The beginning stages are more analogous to explore and the (optional) following iterations are more analogous to exploit.

Intraclass correlation
Can be faster/sped-up via e.g. merge sort/bucket sort?

Related

 * 1) Heuristic

Comparison sort
Comparison sort is related to "ordinal scale".

Noise

 * 1) The less noise increases loss, the more efficient.
 * 2) The more it can make use of noise, the more efficient.
 * 3) (Analogs) Neuronal/Synaptic noise.

Computer performance

 * 1) A higher algorithmic efficiency would lead to a higher computer performance.

Metacognition

 * 1) Metacognition is an example of increasing algorithmic efficiency.

Degrees of separation

 * 1) A lower degrees of separation could lead to a higher algorithmic efficiency.

Learning rate

 * 1) A higher algorithmic efficiency would lead to a higher learning rate e.g. less steps per iteration.

Cognitive load

 * 1) A higher algorithmic efficiency would lead to one or a combination of:
 * 2) Extraneous cognitive load requires less neural resources (per unit/on average) e.g. better filtering;
 * 3) Less steps per iteration could lead to a lower intrinsic cognitive load;
 * 4) Less neural resources required for germane cognitive load (e.g. encoding/decoding long-term memories) e.g. less semantic distances.

Related

 * 1) Learning rate