#shorts ⚡Tau is decidable.

Save
3 years ago
1

🔥 TML (Tau Meta Language) solves Turing Complete Machine (programming language like Solidity of Ethereum) undecidability problems.

💎The following program does 6 steps and returns to the state where it initially started.
🔴TML has to stop and outputs: unsat.
♾️Not stopping would cause an infinite loop.

true.
toggle :- true.
~toggle :- true.

🚩Error: unsat (contradiction).

⚡Tau, the software built for people.

🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀

🧀Test it.
🔗 tml.idni.org
📄Abstract: Draft for Community Review
🔗https://lnkd.in/gWJZj9sN
😼Published codes
🔗 github.com/IDNI/TML
🌐Website of tml
🔗 tau.net/
👨‍🏫Tutorial Videos of TML
🔗https://rb.gy/9ahenx
✈️Telegram community
🔗t.me/tauchain
🤖Reddit community
🔗https://www.reddit.com/r/tauchain/

Loading comments...