Recognition To Abstraction, Attempt One

In The Resolution Of Newcomb’s Paradox (MP 1), Langan suggests a generalization from recognition to abstraction:

"Thus, the accepting behavior of F is defined inductively for s-quantized string extensions; the way in which we recognize and assimilate new bits of information within our reality is specified in dp. Were we to widen the discussion to imagination, conceptualization, theorization, or other intrinsic computations, we would need to consider "ideas"; we would have to generalize from recognition to abstraction by means of a nonlocal or self-iterating, input-free extension of d."

A basic illustration of this structure can be found here:

Newcombs-Demon/RecognitionToAbstraction.js at main · ctmuinayear/Newcombs-Demon

Though this illustration is almost too simple, we will move on before coming back to it.