-
Book Overview & Buying
-
Table Of Contents
Mathematics of Machine Learning
By :
Problem 1. Using truth tables, show that
(a) A ∨¬A is true,
(b) and A ∧¬A is false.
In other words, A ∨¬A is a tautology, while A ∧¬A is a contradiction. (We call expressions that are always true tautologies, while expressions that are always false are contradictions.)
Problem 2. Define the exclusive or operation XOR, denoted by ⊕, by the truth table
Show that
(a) A ⊕B ≡ (¬A ∧B) ∨ (A ∧¬B)
(b) and A ⊕B ≡ (¬A ∨¬B) ∧ (A ∨B)
holds.
Read this book alongside other users, Machine Learning experts, and the author himself. Ask questions, provide solutions to other readers, chat with the author via Ask Me Anything sessions, and much more. Scan the QR code or visit the link to join the community. https://packt.link/math