Aspects of the embodiments are directed to computationally modeling a filtered temporal spike train trace in the digital domain. A current value of the trace, and a parameter defining temporal behavior of the trace, are each stored. A decay function of the trace is computed based on the parameter and on passage of discrete time increments. Stimulus signaling is received, and an input response function of the trace is computed based on the stimulus signaling. A stochastic computation of the trace decay function may be performed based on a generated randomization value. In some embodiments, a delayed computation of the trace decay function may be performed.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. Apparatus for computationally modeling a filtered temporal spike train trace in the digital domain, the apparatus comprising: computing hardware, including processing and data storage circuitry; wherein the computing hardware is to implement a trace engine that includes: a trace state variable store to store a current value of the trace; a function definition store to store a parameter defining temporal behavior of the trace; a trace decay modeler to compute a decay function of the trace based on the parameter and on passage of discrete time increments; and an input response modeler to receive stimulus signaling and to compute an input response function of the trace based on the stimulus signaling; wherein the trace decay modeler is to perform a stochastic computation of the trace decay function based on a generated randomization value. 2. The apparatus of claim 1, wherein the stochastic computation of the trace decay function is based on a probability-based decrementing of the trace state variable. 3. The apparatus of claim 2, wherein the probability-based decrementing of the trace state variable is defined as x/τ, wherein x is a value of the trace state variable and wherein τ is the exponential time constant associated with the parameter defining the temporal behavior of the trace. 4. The apparatus of claim 1, further comprising a pseudo-random number generator to generate the randomization value. 5. The apparatus of claim 4, wherein the pseudo-random number generator includes a linear-feedback shift register. 6. The apparatus of claim 1, wherein the trace decay modeler is to compare the randomization value against a value based on the current value of the trace to produce a comparison result, and wherein the trace decay modeler is to decrement the current value of the trace conditionally in response to the comparison result when the current value of the trace has been decayed to an extent wherein more than one time increment corresponds to a further incremental reduction in the value of the trace. 7. The apparatus of claim 1, wherein an intermediate value of the trace is represented by a first set of bits corresponding to a whole value and a second set of bits corresponding to a fractional value, and wherein decay modeler is to apply a randomized rounding to the fractional value such that only the first set of bits is stored. 8. The apparatus of claim 1, wherein the temporal behavior of the trace is an exponential decay corresponding to a defined time constant. 9. The apparatus of claim 1, wherein the computing hardware is to implement a neuromorphic computing system that includes a plurality of neural network cores configured to send and receive spike messages, wherein the stimulus signaling includes the spike messages, and wherein the trace engine is a portion of a first neural network core of the plurality of neural network cores. 10. The apparatus of claim 9, wherein the neuromorphic computing system is constructed to operate in an asynchronous regime in which different operations of the trace decay modeler are computed over different amounts of time. 11. The apparatus of claim 9, wherein the neuromorphic computing system is constructed to operate according to a spike timing-dependent plasticity model. 12. The apparatus of claim 1, wherein the trace state variable store stores a plurality of state variables associated with different time constants. 13. The apparatus of claim 1, wherein the trace decay modeler is to perform a delayed computation of the trace decay function in response to a stimulus signal received by the input response modeler following passage of a plurality of discrete time increments during which no stimulus signaling occurs and during which no computation of the trace decay function was performed, wherein the delayed computation takes into account decay of the trace occurring over the plurality of discrete time increments. 14. The apparatus of claim 13, wherein the trace decay modeler is to perform at most log2(n) iterative computation operations based on the parameter defining the temporal behavior of the trace, wherein n represents the quantity of the plurality of discrete time increments during which no stimulus signaling occurs and over which the decay of the trace is to be computed. 15. The apparatus of claim 13, wherein the trace engine further includes a pre-computed constant store containing a quantity N of pre-computed constants α2̂i wherein α represents the parameter defining the temporal behavior of the trace, N represents the number of binary digits representing the quantity of the plurality of discrete time increments during which no stimulus signaling occurs and over which the decay of the trace is to be computed, and i represents an iteratively-incremented bit-position index of the N binary digits. 16. At least one machine-readable medium containing instructions that, when executed by computing hardware, cause the computing hardware to computationally model a filtered temporal spike train trace in the digital domain, wherein the instructions are to cause the computing hardware to perform: storing a current value of the trace; storing a parameter defining temporal behavior of the trace; computing a decay function of the trace based on the parameter and on passage of discrete time increments; receiving stimulus signaling and computing an input response function of the trace based on the stimulus signaling; and executing a delayed computation of the trace decay function in response to a stimulus signal received after passage of a plurality of discrete time increments during which no stimulus signaling occurs and during which no computation of the trace decay function was performed, wherein the delayed computation takes into account decay of the trace occurring over the plurality of discrete time increments. 17. The at least one machine-readable medium of claim 16, wherein in performing the delayed computation according to the instructions, at most log 2(n) iterative computation operations are performed based on the parameter defining the temporal behavior of the trace, wherein n represents the quantity of the plurality of discrete time increments during which no stimulus signaling occurs and over which the decay of the trace is to be computed. 18. The at least one machine-readable medium of claim 16, further comprising: instructions for storing a quantity N of pre-computed constants α2̂i wherein α represents the parameter defining the temporal behavior of the trace, N represents the number of binary digits representing the quantity of the plurality of discrete time increments during which no stimulus signaling occurs and over which the decay of the trace is to be computed, and i represents an iteratively-incremented bit-position index of the N binary digits. 19. The at least one machine-readable medium of claim 16, further comprising: instructions for performing a stochastic computation of the trace decay function based on a generated randomization value. 20. The at least one machine-readable medium of claim 19, wherein the stochastic computation of the trace decay function is based on a probability-based decrementing of the trace state variable. 21. The at least one machine-readable medium of claim 19, wherein the probability of decrementing the trace state variable is defined as x/r, wherein x is the trace state variable and wherein r is the exponential time constant associated with the parameter defining the temporal behavior of the trace. 22. The at least one machine-readable medium of claim 19, further comprising: instructions for comparing the randomization value against a value based on the current value of the trace to produce a comparison result; and instructions for decrementing the current value of the trace conditionally in response to the comparison result when the current value of the trace has been decayed to an extent wherein more than one time increment corresponds to a further incremental reduction in the value of the trace. 23. The at least one machine-readable medium of claim 19, wherein an intermediate value of the trace is represented by a first set of bits corresponding to a whole value and a second set of bits corresponding to a fractional value, and further comprising: instructions for applying a randomized rounding to the fractional value such that only the first set of bits is stored. 24. A system for computationally modeling a filtered temporal spike train trace in the digital domain, the system comprising: means for storing a current value of the trace; means for storing a parameter defining temporal behavior of the trace; means for computing a decay function of the trace based on the parameter and on passage of discrete time increments; means for receiving stimulus signaling and computing an input response function of the trace based on the stimulus signaling; and means for executing a delayed computation of the trace decay function in response to a stimulus signal received after passage of a plurality of discrete time increments during which no stimulus signaling occurs and during which no computation of the trace decay function was performed, wherein the delayed computation takes into account decay of the trace occurring over the plurality of discrete time increments. 25. The system of claim 24, wherein in the delayed computation, at most log2(n) iterative computation operations are performed based on the parameter defining the temporal behavior of the trace, wherein n represents the quantity of the plurality of discrete time increments during which no stimulus signaling occurs and over which the decay of the trace is to be computed.