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

In addition, one major practical implementation detail between Datalog and TML is that on TML, you must remember all the previous states of the computation. At first sight, it can be an insane amount of memory, far from practical. Not only memory but also the process of comparing to each previous step. It's just horrendous. But thanks to the canonicity of BDDs, we can do it very fast because each step is canonically identified by a simple number. And this is one aspect of BDDs which is boolean functions. The second aspect of BDDs which is completely equivalent, any boolean function or any BDDs are the same, can be seen as a set of bit strings, a set of binary strings, which is simply the set of binary strings that make the formula true. So internally, in TML, what we do, is all the tables that TML got, we convert them to binary tables, and we make the data only zeros and ones, we can do it because the universe size is fixed or at least known at each step. So each set of tuples is a BDD is one Boolean Function. - Ohad Asor, Founder & CTO of Tau https://tau.net/our-team/ #shorts
#Tau #Tauchain #Agoras

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

🧀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