Having read the wikipedia article and a similar question on the topic of linear separability, I still lack the understanding of this concept to explain any more than the most rudimentary euclidian example of it:
I understand that a set of dots on a 2D plane is linearly separable if a straight line can be drawn through it. This specific instance of a linear separable problem makes intuitive sense to me, but I am struggling to apply this knowledge to help me understand why other problems might be linearly separable. For example, why is the OR gate classifier linearly separable?
Input 1 | Input 2 | Output
0 | 0 | 0
1 | 0 | 1
1 | 1 | 1
0 | 1 | 1
Without resorting to dots and lines on a page, can you compose a simple and intuitive explanation for why the above problem is linearly separable?