TML12: Limitations and Drawbacks #shorts

TML cannot do everything that requires more than polynomial space to be done. Another drawback of TML which comes from the usage of BDDs is arithmetic, in particular multiplication. Multiplication is highly inefficient in TML because of the nature of BDDs. Of course, BDDs bring so many more good things that even this drawback of slow multiplication is small compared to all the gains that it has given us.

Another limitation is the containment problem or should I say the satisfiability problem of a formula without a model, to ask whether a model exists, this is undecidable already on the very restricted classes as follows from Trachtenborg theory. So in particular the containment problem, satisfiability problem, and validity problem are undecidable in TML as is and for them to be decidable, I need to restrict even more extra expressive power and look at narrower fragments of the language. A matter this will be emphasized in the next version of the whitepaper.
- Ohad Asor, Founder and CTO of Tau https://tau.net/our-team/
#shorts

🎥 https://www.youtube.com/watch?v=vWxDEruCaS4&list=PLeBSjZu0y6vXYCHH38ToqlVoyOd1qeS5f&index=12 👈

🧀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