SC4 Tau Language: The Key to Trusted Decentralization with Mathematical Proofs #shorts

Besides blockchain built-ins, The most important part of the Tau language is decidability. It is mathematically possible to get mathematical proof to answer to any expressible question. You can have some body of knowledge or machine code if it is formulated in Tau language. Then you could ask questions about this knowledge again in Tau's language and have mathematical proof of the answer. This is for itself not very new. You can already have with other languages mathematical proof about questions.

There are already existing decidable languages, none of them is of course Turing-complete because Turing-complete languages are incomplete in the logical sense. Most of the interesting questions are unable to have answers in general in Turing-complete languages and this is a known fact known as Rice's Theorem which stands out of the Halting problem which was discovered by Turing himself. But those existing languages, yet have nothing to do with decentralization, and this is where Tau comes.

Ohad Asor, Founder and CTO of Tau - https://tau.net/our-team/

🎥 https://www.youtube.com/watch?v=jnFErWIMs1E&list=PLeBSjZu0y6vV-vSKu9EcoaceQEiWtYcP6&index=4 👈

#Tau #Tauchain #Agoras #shorts #blockchain #formalverification

🧀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

Follow me on
Facebook: Andrew Onizuka
Twitter: @AndrewOnizuka
Instagram: andrewonizuka
Tiktok: andrewonizuka
Reddit: Andrew_Onizuka