Metraipolis › archive › dc_fa38e1618a7a

Computons for Control-Driven Boolean Circuits — arXiv:2611.01837

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01837
License (as archived)
CC0-1.0
Archived
2026-11-03T11:45:54.463Z
SHA-256 of the archived text
cafc65b4415bec1b74cd86ec1ff286074ab34902e68ebf6c000793c905b398f4
Stable URL of this page
https://metraipolis.com/documento/dc_fa38e1618a7a

How to cite

Computons for Control-Driven Boolean Circuits — arXiv:2611.01837 — arXiv (en), https://arxiv.org/abs/2611.01837 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa38e1618a7a (Metraipolis archive dc_fa38e1618a7a, sha256 cafc65b4415bec1b74cd86ec1ff286074ab34902e68ebf6c000793c905b398f4)
BibTeX
@misc{dcfa38e1618a7a,
  title = {Computons for Control-Driven Boolean Circuits — arXiv:2611.01837},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01837},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa38e1618a7a; sha256 cafc65b4415bec1b74cd86ec1ff286074ab34902e68ebf6c000793c905b398f4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01837. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Boolean circuits abstract away from physical implementation details to capture the logical structure and computational behaviour of digital components. Despite their long history of study, their compositional foundations have received comparatively little attention. Building on the theoretical foundations of computons introduced in previous work, we develop a concrete and operationally defined model of computation for control-driven Boolean circuits. We introduce colimit-based operators for composing circuits into sequential, parallel, branching and iterative structures, supported by concrete operational semantics grounded in particular abstract computing devices. The framework refines the semantics of composition, establishes the algebraic properties of its operators and introduces atomic circuits to support more expressive computation units. We demonstrate the applicability of the proposed framework through examples from propositional logic, biomedicine and electronics, and establish an operational equivalence with respect to classical Boolean circuits through a systematic transformation that accommodates gates of arbitrary arity. By this equivalence, we show that control-driven Boolean circuits are at least as powerful as their classical counterpart. That is, they are capable of non-uniformly computing any Boolean function over inputs of arbitrary length. Implementations in Idris and Java demonstrate the practical realisability of the framework.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.01837 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:08:07.224Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).