We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Unthree star programmer
Jump to navigation
Jump to search
Unthree star programmer is Turing complete because it is possible to compile Three Star Programmer (without I/O, which is not required for Turing-completeness) into it.
is there any proof that Three Star Programmer itself is Turing complete? --dragoneater67 [talk|contribs] 04:51, 30 October 2026 (UTC)
- While not formally proven, it is mentioned on the page that it is possible to make a queue in similar way as in I/D machine and translate Cyclic tag system into it. --ChuckEsoteric08 (talk) 05:23, 30 October 2026 (UTC)