Spiking neurons implement computer logic using brain-like processes

Fully Spiking Neural Implementation of Lambda-Calculus Beta-Reduction via Biologically Documented Mechanisms

Neural and Evolutionary Computing

Summary

This paper shows how a fundamental computer process called beta-reduction in lambda-calculus can be done entirely by networks of spiking neurons, which are brain-inspired electrical units. The researchers use realistic neuron behaviors and patterns seen in biology to simulate each step needed for this logical operation. Their system matches traditional symbolic computations perfectly on various examples, including math and logic tasks. This is the first time such a complete symbolic computation is done exclusively through spiking neuron activity grounded in real biological mechanisms.

What this means in practice

  • For neuromorphic hardware engineers: Build hardware that performs symbolic logic computations using biologically inspired spiking neuron circuits for improved brain-like reasoning capabilities.$Commercial implications: Enables commercial neuromorphic chips that directly execute complex symbolic algorithms for AI and brain-inspired computing products.
  • For cognitive robotics teams: Design robot control systems that implement symbolic reasoning purely with spiking neural models for more naturalistic decision-making processes.

Authors

Vladimir A. Lazovskiy, Victor B. Kazantsev, Sergey V. Stasenko

Abstract

We present the first complete implementation of $β$-reduction in the untyped $λ$-calculus using exclusively spiking neural dynamics. Every step of the reduction---redex detection, subterm segmentation, variable-binding detection, De~Bruijn index arithmetic, token copying, and inter-step role maintenance---is performed by leaky integrate-and-fire (LIF) neurons with explicit membrane dynamics, exponential synaptic currents, axonal delays, and pair-based spike-timing-dependent plasticity (STDP). Each neural component maps onto a specific, experimentally documented mechanism: Jeffress-type delay-line coincidence for redex detection; a line-attractor balance counter for subterm segmentation; $θ$--$γ$ cross-frequency coupling for De~Bruijn variable binding; a phase-ring traveling wave for depth-index arithmetic; theta-cycle STDP for token copying; and recurrent persistent firing for role maintenance between reduction steps. All synaptic weights are derived analytically from measured EPSP amplitudes; no hand tuning is performed. The closed-loop system achieves 100\,\% agreement with a symbolic oracle across ten validation classes, including Church numeral arithmetic (\textsc{plus}, \textsc{mult}, \textsc{pred}), Boolean logic with divergent branches, Y-combinator steps, terms with up to six bound-variable occurrences, De~Bruijn indices up to~12, noise robustness, and determinism. To our knowledge this is the first Turing-complete symbolic computation performed entirely within spike dynamics using biologically grounded circuit primitives. We discuss implications for neuromorphic proof assistants and the neural basis of symbolic reasoning.