In Folha, Viana explains Boole's function.
Reproduction of Marcelo Viana's column in Folha de S. Paulo.
Our dear reader is applying for a great job. The company asks a series of questions which the reader must answer in a binary fashion: Yes or No. Based on these answers, the hiring manager decides whether to hire her, also in a binary fashion.
Unfortunately, the answer is no! And the reader wonders—hypothetically, of course!—if it wouldn't have been better to "trick" some of the answers… How many little lies would have been enough to make the result positive?
This type of procedure exemplifies what mathematicians and computer scientists call a "Boolean function," which is a rule for transforming a certain number of binary data points (the reader's answers) into a binary result (the decision about hiring her). The simplest and most interesting example is "negation," which uses only one piece of data: if its value is Yes, the result is No; and if the value of the data point is No, the result is Yes.
Read more: IMPA already has seven events planned for 2023
Summer course brings together Brazilians and foreigners at IMPA.
OBMEP: Double the pride in the Santos family
The name honors the English mathematician and philosopher George Boole (1815-1864), author of the book "The Laws of Thought," published in 1854. In it, Boole introduced what we now call "Boolean algebra," which is a mathematical formulation of logic. In this theory, binary values can be Yes and No, as in our example, or True and False, or even 1 and 0, which are my class's favorites: it makes no difference.
