SC2 Decidable Logic in Tauchain: How It Enables Computers to Think and Answer Questions #shorts

Question: Why does the Tauchain language need decidable logic?
Answer: In order to make the computer understand all possible consequences and think for you, then you need a decidable language. Only this way, can a computer actually answer questions with a given knowledge base. And "Turing-complete" language is highly undecidable. There is a theory in computer science called Rice's theorem, that shows that all non-trivial properties of Turing machines are undecidable in general. And by "non-trivial" we simply mean a property that some Turing machine has and some Turing machine doesn't have. Ohad Asor, Founder and CTO of Tau - https://tau.net/our-team/

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

#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

Many thanks to:
Video by artemy tavrasov: https://www.pexels.com/video/3d-blue-object-4696278/
Video by cottonbro: https://www.pexels.com/video/reflection-of-codes-in-a-woman-5473981/