Outline of a Cue Editor

Abstract

Without a cue editor, humans would suffer frequent mental blocks, harming their chances of survival. Cues are assumed to be taken from the attributes of information in conscious short-term memory (STM) and these normally result in one or more returns from long-term memory. Whenever returns occur normally, the cue editor is bypassed. However, should cues be inconsistent or ineffective in some way, with no returns in associative memory, the defective cues are routed into a register of simulated qubits.

Here the probability of each given cue is systematically reduced slightly from 100% so that fewer cues are applied to associative memory. This greatly increases the chance of a return. If this fails, all cues are restored and a different set of cues are removed randomly. This process is repeated with increasing probability that cues will be removed until matches in associative memory occur. This clears the register and stops the cue editing process until the occurrence of the next set of inconsistent cues.

A significant consideration is that, if a new image appears in conscious STM during this process, the functions of the simulated qubits on the inconsistent cues are suspended temporarily to permit a memory search in response to the new image. Soon after the new search completes, cue editing resumes using the inconsistent cues. Should the new set of cues also be inconsistent with no returns, the original cues are discarded in this simplified plan. New inconsistent cues are shuffled into and overwrite what is currently in the cue editing register.

It is important to note that the above plan supports subliminal memory search. This occurs when there is a memory block due to inconsistent cues, but unknown to a person, a search proceeds in the background. Cues are processed subconsciously and often, when least expected, the forgotten item clicks into consciousness.

Logic circuitry for a cue editor is suggested, although time delays and identifications of dendritic and enabled gates are omitted in an attempt to simplify the presentation.

An alternative method is also presented that involves simulated qubits working as controlled toggles to generate pseudorandom code. This serves to randomly close gates for a few cues, thus increasing the chance of a hit. Pseudorandom counts are accomplished with a shift register sequence, using circuits as shown below.