# The Elements of Computing Systems - 2ed - Appendix comprehension problem

3 messages
Open this post in threaded view
|

## The Elements of Computing Systems - 2ed - Appendix comprehension problem

 This post was updated on . Hello all, not sure if this is the right forum to do so, but I'm having a little bit of trouble understanding a concept presented in the book. At the moment I refer to the 1st appendix, "Boolean Function Synthesis". Any overall help understanding this appendix concept would be welcome, but in order to try to help this thread's reader, I'll try citing a more specific snippet. I didn't really understand the part where the authors start differing between a Boolean -function- and a Boolean -expression-.  But the part that I really didn't understand was the one following Figure A1.1. I will copy the exact text I refer to: "We'll describe the synthesis algorithm by following its steps in this particular example. We start by focusing only on the truth table's rows in which the function's value is 1. In the function shown in figure A1.1, this happens in rows 3, 5, and 7. For each such row i, we define a Boolean function fi, that returns 0 for all the variable values except for the variable values in row i, for which the function returns 1. The truth table in figure A1.1 yields three such functions, whose truth table definitions are listed in the three rightmost columns in the table. Each of these functions fi can be represented by a conjunction (And-ing)...". I really understand what was being done here, and why. Given this is an optional part of the book, I've decided to continue reading while this question isn't answered, but given that I would like to understand this concept, I thank you all beforehand for helping me reach this understanding. * If this is not the right forum to post such subjects, please let me know and I will do so accordingly.