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

And with BDDs we can efficiently perform union, intersection, and complementation of such sets. By that, in contrast to other solvers, they work tuple by tuple, but us we set one BDD is the whole table, so everything is processed in batch mode. You process the whole table at once while it remains in a compressed form. We don't need to decompress it in order to do this processing, it is yet indeed another aspect of BDDs that in many cases, they provide sometimes an unimaginable compression. Things that cannot physically possibly feed the universe, sometimes of course not always. BDD can feed them very succinctly. - Ohad Asor, Founder & CTO of Tau https://tau.net/our-team/ #shorts
#Tau #Tauchain #Agoras

🎥 https://youtube.com/shorts/NJsiCGoAw1A 👈

🧀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