Descriptive complexity for neural networks via Boolean networks

DOI10.4230/LIPICS.CSL.2024.9MaRDI QIDQ6856050zbMATH OpenFDO

Authors Veeti Ahvonen, Damian Heiman, Antti Kuusisto

Publication date 19 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2024.9

zbMATH Keywords

Boolean networksdescriptive complexityfloating-point arithmeticlogicneural networks

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A Linear Representation of Dynamics of Boolean Networks
• Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment
• Descriptive complexity for distributed computing with circuits
• Elements of finite model theory.
• Modal logic and distributed message passing automata
• Size-depth tradeoffs for Boolean formulae
• The descriptive complexity of graph neural networks
• The logic of graph neural networks
• Weak models of distributed computing, with connections to modal logic
• Weak models of distributed computing, with connections to modal logic

Cited in

(1)

• Descriptive complexity for neural networks via Boolean networks

This page was built for publication: Descriptive complexity for neural networks via Boolean networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856050)