Talk:Around and around, sleeping sound

From Esolang
Jump to navigation Jump to search

Computational class

Is there a proof for Turing-completeness?--ChuckEsoteric08 (talk) 14:53, 12 October 2024 (UTC)

IDK, I managed to find a proof for +, -, <, >, and ., but not loops. -Someone. (talk)