Talk:Backtick
Jump to navigation
Jump to search
Where is the proof of turing completeness? --Yayimhere2(school) (talk) 18:57, 1 January 2026 (UTC)
I have not implemented it. But, this language does have conditionals, looping, jumping, basic arithmetic, various storage methods and more. This means that it is almost certainly Turing complete. --Splot-dev (talk) 22:07, 17 January 2026 (UTC)