McCulloghPitts Neuron 
Introduction
This applet demonstrates a McCulloghPitts neuron.
Credits
This applet was modified by Alix Herrmann from the original Artificial
Neuron applet written by Fred
Corbett, available here.
Theory
The first computational model for an artificial neuron was proposed by
McCulloch and Pitts in 1943.
The main difference between this model
and the Artificial Neuron model is the use of absolute inhibitory input.
This neuron is able to implement nonmonotonic logic functions.
The inputs and outputs are binary (exclusively ones or zeros);
the nodes produce only binary results.
There are no weights, and the activation
function is always the unit step function.
Thus, the elements of a McCullochPitts neuron are

A set of n excitatory
inputs, x_{i}.

A set of m inhibitory
inputs, x_{n+j}

A threshold,
u.

A unit step activation function.

A single neuron
output, y.
In diagrams, we can represent a McCullochPitts neuron as a circle labeled
with the threshold value; inhibitory inputs are indicated with a
small circle, as shown below.
McCullochPitts neurons have some nice theoretical properties:
 one can construct constantdelay circuits with them
 because they use threshold logic, component replication can be used to achieve fault tolerance  both in the case of unreliable computing units, and of unreliable connetions.
Applet

To change the inputs, click on the buttons.

To change the threshold, type a new value in the field inside the circle
and press the RETURN key.

Important!
To toggle an input from excitatory to inhibitory, click on the arrowhead.
The arrowhead changes to a dot. To change back, click again.
Questions

Which of the 2input binary logical functions can be computed with a McCullochPitts

We can define two kinds of inhibition:

relative inhibition, the kind used in an Artificial Neuron with
a unit step function, is implemented using negative weights

absolute inhibition, the kind used in McCullochPitts units.
Convince yourself that networks of McCullochPitts units are equivalent
to networks with relative inhibition. (A unit in a relative inhibition
network has an "equivalent circuit" composed of one or more absolute inhibition
units.)

[Optional paper and pencil problem] So far we have neglected time.
Let us introduce discrete time by specifying that each unit updates its
output in one time step. Thus if an input arrives at time t, the
result is updated at t+1. This allows us to build recurrent
networks and is more biologically plausible.
With this modification it can be shown that any finite automaton
can be simulated with a network of McCullochPitts units. (An automaton
is a device that assumes different states; at any time step, the next state
is determined by the current state and the current input. The state transitions
and output of an automaton may be represented in a state transition table
and output table or in a state transition diagram.)
Design a recurrent McCullochPitts network to add two sequential streams
of bits.