))
OEIS A000370: NPN Equivalence Classes of Boolean Functions
Manage episode 509356506 series 3690682
المحتوى المقدم من Mike Breault. يتم تحميل جميع محتويات البودكاست بما في ذلك الحلقات والرسومات وأوصاف البودكاست وتقديمها مباشرة بواسطة Mike Breault أو شريك منصة البودكاست الخاص بهم. إذا كنت تعتقد أن شخصًا ما يستخدم عملك المحمي بحقوق الطبع والنشر دون إذنك، فيمكنك اتباع العملية الموضحة هنا https://ar.player.fm/legal.
NPN equivalence groups functions that can be turned into one another by flipping inputs, permuting inputs, and possibly inverting the output. A000370 counts how many such equivalence classes remain for each n: 1 for n=0, 2 for n=1, 4 for n=2, 14 for n=3, 222 for n=4, and 616,126 for n=5, illustrating the dramatic compression. In practice, each class has a canonical representative—the lexicographically smallest truth table among all NPN transforms—so tools can store one circuit per class and realize others by simple wiring or inverters. We’ll unpack the group action that does the flipping and swapping, why the reduction is so powerful, and what Harrison proved about the asymptotic growth of the number of classes. It’s a striking example of how structure hides in plain sight in Boolean logic and why researchers study these symmetries—it's a shortcut through combinatorial chaos.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
1332 حلقات
مشاركة
