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
Q. How to input to circuit? Register A bits as a0, a1, a2 and a3 in the corresponding X bits of the Full Adder (FA). Register B bits as given in the Figure above as in

The binary equivalent of (FA) 16   is ? Ans. (FA) 16 = (11111010) 10

Find the boolean expression for the logic circuit shown below. Ans. Output of Gate-1 (NAND) = (AB)' Output of Gate-2 (NOR) = (A'+B)' Output of Gate-3 (NOR) = [(AB)' + (

Q. Explain about IFRAME? is an HTML 4.0 addition to frames toolbox. Presently only MSIE supports . Unlike frames created employing and

Distortion caused on telephone line by an adjacent one is called (A) Cross Fire                      (B) Inductive Disturbance (C)  Cross Talk                     (D) Non

I have chosen an imaginary example to illustrate the different stakeholder categories. At Home sells a selection of consumer products, currently listed in a paper catalogue, whi

Acting Rationally: "Al" Capone was finally convicted for tax evasion. Were the police reacting on rationally?? To solve this puzzle, we must first look at how the performance

Create a class called auditorium that specifies the seats in the auditorium. The class should include at least one data item: seat (two dimensional array of Char) and at least thre

Q. Explain Error Detection and Correction Codes? Before we wind up data representation in reference of today's computers one should determine about code that helps in correctio

Tree (recursive definition) A tree is a finite set of one or more than one nodes such that. (1) There is a specially designated node known as the root. (2) The left over