Binding Neuron¶
An abstract spiking-neuron model that retains excitatory impulses for a finite window and emits one spike when enough temporally overlapping inputs reach threshold, with inhibition tightening the required coherence.
Core Idea¶
A binding neuron (BN) is a specialized abstract neuron concept introduced by Alexander Vidybida. Excitatory impulses arriving within a finite memory window remain active; when their count reaches threshold, the neuron emits one output impulse and clears or updates its stored inputs. The spike represents the temporally coherent input set as one compound event.
Inhibition has an information-processing role: stronger inhibition reduces the effective memory window or otherwise requires tighter temporal coherence before threshold is reached. The BN interpolates between a temporal integrator at long memory and a coincidence detector at short memory.
How would you explain it like I'm…
The Tipping Raindrop Bucket
The Close-Together Signal Counter
Time-Window Threshold Neuron
Cross-Domain Echoes¶
See how this entry connects to another domain.
Scope of Application¶
The concept supports analytic and simulated studies of spike-train transformation, output interspike distributions, inhibition, feedback, and neuromorphic implementation. Hodgkin–Huxley and leaky integrate-and-fire systems can approximate its step-like coherence response under chosen conditions.
Its biological claims are limited by equalized impulse amplitudes, single retention time, simplified inhibition, absent morphology, and often omitted refractoriness.
Clarity¶
State \(\tau\), threshold, reset rule, inhibition rule, input process, feedback delay, and output statistic. Label it a model/concept, not a cell class. Distinguish temporal input binding from perceptual feature binding.
Manages Complexity¶
Finite impulse lifetime converts continuous postsynaptic dynamics into an event-memory process that can sometimes be analyzed exactly. The threshold and window expose how synchrony and inhibition jointly determine firing without solving full conductance equations.
Abstract Reasoning¶
- Record each input arrival.
- Retain it until age \(\tau\).
- Remove expired impulses.
- Fire when the active count reaches threshold.
- apply the declared reset.
- Map inhibition to a changed window or gate.
- Derive output statistics under the input process.
- Compare limiting behavior with integration and coincidence detection.
Knowledge Transfer¶
The portable pattern is retain events briefly, collapse a sufficiently coherent cluster into one output, and let inhibition tune the clustering window. It transfers to event-stream detectors and temporal debouncing. The proposed immediate parent is Temporal Binding.
Relationships to Other Abstractions¶
Current abstraction Binding Neuron Domain-specific
Parents (1) — outgoing typed relations
-
Binding Neuron is a kind of Temporal Binding Domain-specific
Temporal Binding is the broader abstraction this entry instantiates.
Hierarchy paths (3) — routes to 3 parentless roots
- Binding Neuron → is a kind of Temporal Binding → includes Aggregation → is a kind of Transformation → is a kind of, typical Function (Mapping)
- Binding Neuron → is a kind of Temporal Binding → is a decomposition of Abductive Reasoning
- Binding Neuron → is a kind of Temporal Binding → includes Threshold
Neighborhood in Abstraction Space¶
Binding Neuron sits in a sparse region of the domain-specific corpus (95th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2769 abstractions)
Nearest neighbors
- Hindmarsh–Rose model — 0.80
- Dendritic Integration — 0.79
- Place Field — 0.77
- BCM theory — 0.76
- F-I curve — 0.76
Computed from structural-signature embeddings · 2026-10-25