Skip to main content
2 of 2
added 2 characters in body
Yuval Filmus
  • 279.1k
  • 27
  • 316
  • 512

Taking mod $2$ with LTF gates

Consider the function : $\mathbb{Z}^{\geq 0} \rightarrow \{0,1\}$ given as $n \mapsto n \bmod 2$. Does this have an easy implementation using Linear Threshold Function gates?


I do not mean that the input is the infinite set of positive integers. Think of the input as coming on a single wire carrying a non-negative integer.