Talk:Echo Tag

From Esolang
Jump to navigation Jump to search

Even if n is large, still the proof should be provided (if it is correct) (just to see if it can be Turing-complete at all); if someone else can prove it Turing-complete for smaller n as well then that can be added. (If you make the proof, you can figure out what is the smallest n you can prove it with (or disprove, if that is the case instead; currenly it is only disproved for 1).) --Zzo38 (talk) 04:12, 18 May 2019 (UTC)

example walkthrough?

it certainly seems interesting, however i do not seem to completely understand it. id appreciate it if you could provide an example for the confused. thanks! --Pro465 (talk) 14:01, 11 June 2023 (UTC)