framework
active
framework:differentiable-logic-cellular-automata-difflogic-ca

Differentiable Logic Cellular Automata (DiffLogic CA)

The novel framework introduced in this paper, combining DLGN and NCA for fully differentiable discrete CA learning

Neighborhood — ranked by edge-count

Methods (3)

method
  • Used for updating hidden state expectations; provides dynamical process theory testable against neuronal data
  • Training regime where random subsets of cells update per step, improving robustness of learned circuits
  • Named technique in DiffLogic CA where fixed-structure logic circuits replace Sobel filters for neighborhood perception

Concepts (8)

concept
  • Process by which cellular collectives generate large-scale structure and form; presented as a collective intelligence problem.
  • Physical systems whose hardware can be dynamically reconfigured, blurring the hardware/software distinction
  • Core feature distinguishing DiffLogic CA from NCA — each cell's state is fully binary rather than continuous
  • Foundational computational paradigm of local rules producing emergent global behavior, extended by this work
  • First stage of DiffLogic CA update where each cell gathers information from neighboring cells via logic gate kernels
  • The key novel property of DiffLogic CA — logic gate networks that are recurrent both spatially and temporally
  • The 8-cell surrounding neighborhood used for cell perception in DiffLogic CA
  • Update Stage
    implements
    Second stage of DiffLogic CA where a DLGN computes each cell's new binary state from perception output and current state

Frameworks (3)

framework
  • Prior framework combining cellular automata with deep learning, extended by this work
  • CAM-8
    analogous_to
    Cellular automata-based computing architecture by Toffoli and Margolus, identified as historical precursor to DiffLogic CA
  • Framework by Petersen et al. using logic gates as neurons with differentiable training, integrated into DiffLogic CA

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.