{"resolved":true,"match_type":"uuid","source_type":"original_book","book_id":"38270854-596f-4a26-8183-db8c968c6020","title":"编码 隐匿在计算机软硬件背后的语言","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787121181184","requested_by":"printed_page","book":{"source_type":"original_book","book_id":"38270854-596f-4a26-8183-db8c968c6020","id":"38270854-596f-4a26-8183-db8c968c6020","uuid":"38270854-596f-4a26-8183-db8c968c6020","title":"编码 隐匿在计算机软硬件背后的语言","normalized_title":"编码隐匿在计算机软硬件背后的语言","author":null,"edition":null,"publisher":null,"year":null,"isbn":"9787121181184","isbns":["9787121181184","0123456789","6044921875","3039331000","0000000000","0000000000000"],"parsed":true,"ai_readable":true,"document_type":"book","page_count":438,"navigation_url":"https://workshop.closeclaw.top/ai/book/38270854-596f-4a26-8183-db8c968c6020","title_url":"https://workshop.closeclaw.top/ai/title/%E7%BC%96%E7%A0%81%20%E9%9A%90%E5%8C%BF%E5%9C%A8%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%BD%AF%E7%A1%AC%E4%BB%B6%E8%83%8C%E5%90%8E%E7%9A%84%E8%AF%AD%E8%A8%80","fixed_page_url_template":"https://workshop.closeclaw.top/ai/book/38270854-596f-4a26-8183-db8c968c6020/page/{printed_page}","path_api_url_template":"https://workshop.closeclaw.top/api/ai/book/38270854-596f-4a26-8183-db8c968c6020/page/{printed_page}","read_url":"https://workshop.closeclaw.top/api/ai/read/38270854-596f-4a26-8183-db8c968c6020","page_url":"https://workshop.closeclaw.top/api/ai/books/38270854-596f-4a26-8183-db8c968c6020/page","search_url":"https://workshop.closeclaw.top/api/ai/books/38270854-596f-4a26-8183-db8c968c6020/search"},"page":{"printed_page":98,"pdf_page":114,"physical_index":114,"physical_index_base":0,"printed_page_status":"recognized","page_sha256":"2fd74851e1783b65cb7258d941a925bb0e519ebdc1bd05abbad3be3526b0c816"},"chapter":"编码隐匿在计算机软硬件背后的语言","content":"$$\n\\begin{array} { r l } & { ( M \\operatorname { A N D } N \\operatorname { A N D } \\left( W \\operatorname { O R } T \\right) ) } \\\\ & { \\qquad \\operatorname { O R } } \\\\ & { ( F \\operatorname { A N D } N \\operatorname { A N D } \\left( \\operatorname { N O T } W \\right) ) } \\\\ & { \\qquad \\operatorname { O R } } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad } \\\\ & { \\qquad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad B } \\end{array}\n$$\n\n有了这个公式，店员就可以做一个布尔测试了。为了避免麻烦，我采用了一种略微有点不同的布尔代数形式—一字母不仅仅代表集合。这里，字母可以用数字来赋值。我们只用数字0和1。数字1代表YES，True，即这只猫是符合这样的标准的。数字0表示NO，False，即这只猫不符合这种特定标准。\n\n首先，店员拿出了一只未绝育的褐色公猫。以下是我期望得到的猫的表达式：\n\n$$\n( M \\times N \\times ( W + T ) ) + ( F \\times N \\times ( 1 - W ) ) + B\n$$\n\n以下是用0和1替换之后的式子：\n\n$$\n( 1 \\times 0 \\times ( 0 + 1 ) ) + ( 0 \\times 0 { \\times } ( 1 - 0 ) ) + 0\n$$\n\n注意，只有M和T的值为1，因为这只猫是褐色的公猫。\n\n现在我们要做的就是化简这个表达式。如果简化结果为1，则这只猫就符合你的标准；如果简化结果为0，那么这只猫就不符合。在化简的时候要切记，我们并不是真的在进行加和乘的运算，尽管通常我们可以当做是。符号“+”代表OR，符号“×”代表AND，在大多同类的规则中适用（有时在现代课本中也使用符号“∧”和“√”来表示AND和OR，而非用符号“×”和“+”。但是在这里符号“+”和“×”是具有特殊意义的）。\n\n当符号“×”代表AND时，有以下几种可能的结果：\n\n$$\n\\begin{array} { l } { 0 \\times 0 = 0 } \\\\ { 0 \\times 1 = 0 } \\\\ { 1 \\times 0 = 0 } \\\\ { 1 \\times 1 = 1 } \\end{array}\n$$\n\n也就是说，只有当运算符AND左右两端都为1的时候，结果才为1。这个运算与常规的乘法是完全相同的，该规则可以总结为如下这样一个表格，这与第8章中加法和乘\n\n编码隐匿在计算机软硬件背后的语言\n\n98","previous_page":97,"next_page":99}