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:/gɹəʊguː/

From Esolang
Jump to navigation Jump to search

This can't be Turing-complete, since it does not have the requisite three unbounded states. Right? --Boinggg (talk) 23:45, 5 July 2022 (UTC)