Example of perceptrons, Computer Engineering

Example of perceptrons:

Here as an example function in which the AND boolean function outputs a 1 only but if both inputs are 1 and where the OR function only outputs a 1 then if either inputs are 1. Here obviously these relate to the connectives we studied in first order logic. But in the following two perceptrons can represent the AND and OR boolean functions respectively: 

936_Example of perceptrons.png

However one of the major impacts of Minsky and Papert's book was to highlight the fact that perceptions cannot learn a particular boolean function that called XOR. In fact this function outputs a 1 if the two inputs are not the same. It means to see why XOR cannot be learned and try or write down a perception to do the job. So here the following diagram highlights the notion of linear reparability in Boolean functions that explains why they can't be learned by perceptions:

733_Example of perceptrons1.png

Practically in each case we've plotted the values taken use of  the  Boolean  function where the inputs are particular values as: (-1,-1);(1,-1);(-1,1) and (1,1). But just because the AND function there is only one place whereas a 1 is plotted, namely where both inputs are 1. Moreover we could draw the dotted line to separate the output -1s from the 1s. So than we were able to draw a similar line in the OR case. Its means there, that we can draw these lines, we say that these functions are linearly separable. Remember there that it is not possible to draw any line for the XOR plot: but where you try then you never get a clean split into 1s and -1s.

Posted Date: 1/11/2013 7:07:05 AM | Location : United States







Related Discussions:- Example of perceptrons, Assignment Help, Ask Question on Example of perceptrons, Get Answer, Expert's Help, Example of perceptrons Discussions

Write discussion on Example of perceptrons
Your posts are moderated
Related Questions
Explain Three-Way Handshake Mechanism used by TCP to terminate a Session reliably. Just to guarantee that connection is sets up or terminated reliably, transfer control protoco

What is insertion sort? Insertion Sort : One of the easiest sorting algorithms is the insertion sort. Insertion sort having of n - 1 passes. For pass p = 2 by  n, insertion so

With reference to telephone traffic, explain the terms BHCA. BHCA: The number of call attempts in the busy hour is termed as busy hour call attempts (BHCA) that is an importa

Which method uses the greatest number of layers in the OSI model? Gateway utilizes the greatest number of layers into the OSI model.

Write a C program to sort in ascending order of n numbers. # include # include void main() { int a[25],no,i,j,m,t; clrscr(); printf("\nEnter Total number

Describe the Working of CRT The electron beam produces a tiny, bright visible spot when it strikes the phosphor-coated screen. A colour CRT monitor has three different coloured

Explain the difference between a function declaration and function definition.    Function declaration and Function definition:  A function declaration having the name of th

(a) How does a data cache take advantage of spatial locality? Give an suitable example. (b) What are the basic differences between a write-allocate and no-write-allocate po

Write "heterogeneous" functions If a program uses simulated, dynamically allocated multidimensional arrays, it becomes possible to write "heterogeneous" functions which don't h

Q. Write a menu driven program to find 9's and 10's complement of a decimal number using file. Perform necessary validation with proper message that entered numbers must be de