Talk:Calculus Constructio
Jump to navigation
Jump to search
- I think it is possible to program cyclic tag in this language, making it Turing complete. The banana of excellence (talk) 20:12, 17 April 2026 (UTC)
- I have implemented bitwise cyclic tag with data string 1, so it is proven to be Turing complete. The banana of excellence (talk) 19:37, 18 April 2026 (UTC)