Binary Decision Diagram on Tau 2 ⚡ Part 1/3 #shorts

Binary Decision Diagram, it's name suggests that it is a decision diagram which is binary in each point we have Yes/No question, and we follow the decision tree. And this name really does no justice at all to BDDs because BDDs are interesting for all reasons except for being decision diagrams. The real utility of BDDs can be seen in two equivalent ways, one way is to represent boolean functions. It was the first and virtually the only known way to canonically represent boolean functions. Canonically means that if they are equal, then the representations are always the same. They are also very convenient when it comes to negation. Other normal forms of boolean functions like conjunctive normal forms, and disjunctive normal forms. They behave badly when you try to negate the formula. But in TML, TML is all about negation, when compare to Datalog, it's all about negation. So we surely meet an efficient negation. - Ohad Asor, Founder & CTO of Tau https://tau.net/our-team/ #shorts
#Tau #Tauchain #Agoras

🎥 https://youtube.com/shorts/2NGttUll08k

🧀Test Tau Meta Language.
🔗 tml.tau.net
📄Abstract: Draft for Community Review
🔗https://lnkd.in/gWJZj9sN
😼Published Codes
🔗 github.com/IDNI/TML
🌐Website of Tau
🔗 tau.net/
👨‍🏫Tutorial Videos of TML
🔗https://rb.gy/9ahenx
✈️Telegram community
🔗t.me/tauchain
Facebook: Andrew Onizuka
Twitter: @AndrewOnizuka
Instagram: andrewonizuka
Tiktok: andrewonizuka
Reddit: Andrew_Onizuka