through inaction, allow a human being to come to harm. 2. A robot must obey the orders given it by human beings, except where such orders would conflict with the First Law. 3. A robot must protect its own existence as long as such protection does not conflict with the First or Second Law. Isaac Asimov The Three Laws of Robotics
• Objects of study have distinct values e.g integers, booleans as opposed to objects with continuous values like real numbers (floating-point numbers). • Involves the study of algorithms, their implementations and efficiencies.
inference. [software testing and debugging] • Set Theory: collections of objects [relational databases] • Number Theory: properties of numbers [cryptography] • Graph Theory: graphs and networks [social networks]
four hours of writing tests for PunchStopper, a new crowdsourcing application, Mirabel decides to implement the features. Fortunately, the first test passes but the application vomits errors in the bash terminal. Mirabel does some investigating and arrives at the following premises: - If the code on line 115 is wrong then the code on line 245 is wrong too. - The code on line 67 is wrong or the code on line 245 is correct but the first test will fail if the code on line 67 is wrong. - The first test passed. By applying the rules of inference,can you arrive at a conclusion?
special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet two inhabitants: Tunde and Eniola. Tunde tells you that Eniola is a knave. Eniola says, `Neither Tunde nor I are knaves.' Can you determine who is a knight and who is a knave?
an alphabetical symbol, that represents a proposition. Examples: - n could represent the proposition “npm is better than gem” - p could represent the proposition “Programmers are lazy and arrogant.”
of a proposition; either of the booleans “true” (T) or “false” (F). Example: - The truth value of the variable n which represents the proposition “npm is better than gem” is true. The can be rephrased as n is true.
connects two or more propositions in a grammatically valid way to create a compound proposition. Also known as logical operators. Examples: - n ∧ p is the compound proposition “npm is better than gem and programmers are lazy and arrogant”. - n ∨ p is the compound proposition “npm is better than gem or programmers are lazy and arrogant or
ioraelosi
miyayou
sshimizu2006
signer
trycycle
nagano
voginip
grow_design_lab
nozakijcom
ianozsvald
akasan
kimpetersen
chriscoyier
akademiya2063
reverentgeek
axbom
marcoroth
keavy
jmmastey
gr2m
varn
sferik
