TML11: PSPACE Complete and Capture PSPACE #shorts
A problem is PSPACE Complete if any problem that can in principle be solved using polynomial space can be converted in a short time to that PSPACE Complete problem. This is what TML being PSPACE Complete means, in fact, TML is not only PSPACE Complete, it is also so-called Capture PSPACE, not only that the conversion can be done but also, the conversion can be done using TML itself. It is not the case for some other PSPACE Complete problems or complete problems in general. So anything that can be computed in polynomial space can be expressed in TML.
- Ohad Asor, Founder and CTO of Tau https://tau.net/our-team/ #shorts
🎥 https://www.youtube.com/watch?v=9R6zjtPREgo&list=PLeBSjZu0y6vXYCHH38ToqlVoyOd1qeS5f&index=11 👈
🧀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
-
0:58
AndrewOnizuka
1 year agoTML12: Limitations and Drawbacks #shorts
-
0:55
AndrewOnizuka
1 year agoTML17: Experience the Power of TML with the Complete IDE at tml.tau.net #shorts
-
4:43
Shane Welcher
1 year agoPLC Programming TRN Instruction in Studio 5000 | Truncate
9 -
21:08
ericntunctu
1 year agoprove IP=PSPACE (1) prove sharp p subset of IP
4 -
0:55
Full Games And Gaming
1 year agoDead Space Extraction In 60 Seconds | Dead Space Extraction
-
10:05
hayksimonyanrumble
11 months agoBig-O Time & Space Analysis
9 -
17:24
ericntunctu
1 year agoprove IP=PSPACE (2) Prove TQBF is in PSPACE
5 -
12:29
ericntunctu
1 year agoComputational complexity: Prove IP is subset of PSPACE
4 -
11:49
ericntunctu
2 years agoInner product space and p norm
3 -
53:26
Gregg Ink Codes
2 years ago512 Subscriber [on youtube] special and creating a Turing complete duCx interpreter.
152