On Complete Sets of Logic Primitives

DOI10.1109/PGEC.1965.263961MaRDI QIDQ5527472zbMATH OpenFDO

Authors Saburo Muroga

Publication date 1965

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1965.263961

zbMATH Keywords

numerical analysis

Cited in

(8)

• Linear function neurons: Structure and training
• Size of ordered binary decision diagrams representing threshold functions
• The capacity of feedforward neural networks
• Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
• Using the Perceptron Algorithm to Find Consistent Hypotheses
• Polynomial threshold functions, hyperplane arrangements, and random tensors
• On the cardinal number of complete sets of Boolean operations†
• On neuronal capacity

This page was built for publication: On Complete Sets of Logic Primitives

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