McCulloch-Pitts Neuron

Table of Contents

_20240117_155811screenshot.png A data structure that looks like the visual.

1. Restrictions/data types

  • \(d_1\) can only be {0,1}
  • \(w_1\) can only be {-1,1}
  • \(\theta\) can only be [-inf,inf]
  • \(X\) can only be {0,1}

2. Computation: input -> output

  1. sums up $d1w1,d2w2…$
  2. if the sum is smaller than \(\theta\), \(X^t = 1\)
  3. if the any input with weight -1 gives 1, \(X^t = 0\)

3. Usage

3.1. simple logic gates

3.1.1. AND   ATTACH

_20240117_161507screenshot.png Only after all input gives one, can \(X\) be 1; other times 0

3.1.2. OR   ATTACH

_20240117_161621screenshot.png Any inupt be 1, \(X\) would be 1

3.1.3. NOT   ATTACH

_20240117_161827screenshot.png \(d = 1 \to X = 0\) \(d = 0 \to X = 1\)

3.2. extended with time

3.2.1. register cell

3.2.2. memory cell

4. learning

no well-known algorithm for it

Backlinks

biocomputation

This page starts at topics covered in University of Liverpool’s COMP305 biocomputations.

Author: Linfeng He

Created: 2024-04-03 Wed 23:17